TSTP Solution File: SEU851^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU851^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:44:04 EDT 2024
% Result : Theorem 4.06s 1.88s
% Output : Refutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 83 ( 14 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 210 ( 60 ~; 24 |; 38 &; 88 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 10 ^ 6 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ( ^ [C: a] :
( ( ( A @ C )
& ~ ( B @ C ) )
| ( ( B @ C )
& ~ ( A @ C ) ) ) )
= ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM42_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ( ^ [C: a] :
( ( ( A @ C )
& ~ ( B @ C ) )
| ( ( B @ C )
& ~ ( A @ C ) ) ) )
= ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ( ^ [C: a] :
( ( ( A @ C )
& ~ ( B @ C ) )
| ( ( B @ C )
& ~ ( A @ C ) ) ) )
= ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
( ( ( sk1 @ A )
& ~ ( sk2 @ A ) )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: a] :
( ( ( sk1 @ A )
& ~ ( sk2 @ A ) )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) )
| ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) )
!= ( ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) )
| ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(35,plain,
( ~ ( ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) )
| ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) )
| ~ ( ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) )
| ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(50,plain,
( ~ ( sk1 @ sk3 )
| ( sk2 @ sk3 )
| ~ ( sk1 @ sk3 )
| ( sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[35]) ).
thf(53,plain,
( ~ ( sk1 @ sk3 )
| ( sk2 @ sk3 ) ),
inference(simp,[status(thm)],[50]) ).
thf(34,plain,
( ( ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) )
!= ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) )
| ( ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) )
!= ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(49,plain,
( ( ( sk1 @ sk3 )
& ~ ( sk2 @ sk3 ) )
!= ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) ),
inference(simp,[status(thm)],[34]) ).
thf(77,plain,
( ( ( sk2 @ sk3 )
!= ( sk1 @ sk3 ) )
| ( ( ~ ( sk2 @ sk3 ) )
!= ( ~ ( sk1 @ sk3 ) ) ) ),
inference(simp,[status(thm)],[49]) ).
thf(84,plain,
( ( sk2 @ sk3 )
!= ( sk1 @ sk3 ) ),
inference(simp,[status(thm)],[77]) ).
thf(128,plain,
( ~ ( sk1 @ sk3 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[53,84]) ).
thf(129,plain,
~ ( sk1 @ sk3 ),
inference(pattern_uni,[status(thm)],[128:[]]) ).
thf(158,plain,
( ( ( $false
& ~ ( sk2 @ sk3 ) )
| ( ( sk2 @ sk3 )
& ~ $false ) )
!= ( ( ( sk2 @ sk3 )
& ~ $false )
| ( $false
& ~ ( sk2 @ sk3 ) ) ) ),
inference(rewrite,[status(thm)],[7,129]) ).
thf(159,plain,
$false,
inference(simp,[status(thm)],[158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU851^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 16:29:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.83/0.82 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.02/0.93 % [INFO] Parsing done (106ms).
% 1.24/0.94 % [INFO] Running in sequential loop mode.
% 1.49/1.15 % [INFO] nitpick registered as external prover.
% 1.63/1.15 % [INFO] Scanning for conjecture ...
% 1.73/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.73/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.73/1.22 % [INFO] Problem is higher-order (TPTP THF).
% 1.73/1.23 % [INFO] Type checking passed.
% 1.73/1.23 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 4.06/1.87 % [INFO] Killing All external provers ...
% 4.06/1.88 % Time passed: 1338ms (effective reasoning time: 933ms)
% 4.06/1.88 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 4.06/1.88 % Axioms used in derivation (0):
% 4.06/1.88 % No. of inferences in proof: 17
% 4.06/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1338 ms resp. 933 ms w/o parsing
% 4.06/1.93 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.06/1.93 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------