TSTP Solution File: SEU934^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU934^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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:17 EDT 2024
% Result : Theorem 2.35s 1.63s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 2 typ; 0 def)
% Number of atoms : 29 ( 28 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 11 ( 6 ~; 2 |; 0 &; 0 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 10 ^ 9 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( ( ^ [C: $i] : ( C = A ) )
= ( ^ [C: $i] : ( C = B ) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM14_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( ( ^ [C: $i] : ( C = A ) )
= ( ^ [C: $i] : ( C = B ) ) )
=> ( A = B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i] :
( ( ( ^ [C: $i] : ( C = A ) )
= ( ^ [C: $i] : ( C = B ) ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( ^ [A: $i] : ( A = sk1 ) )
= ( ^ [A: $i] : ( A = sk2 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( ^ [A: $i] : ( A = sk2 ) )
= ( ^ [A: $i] : ( A = sk1 ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(8,plain,
! [A: $i] :
( ( A = sk2 )
= ( A = sk1 ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(11,plain,
! [A: $i] :
( ( A != sk2 )
| ( A = sk1 ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(13,plain,
! [A: $i] :
( ( A != sk2 )
| ( A = sk1 ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(15,plain,
sk2 = sk1,
inference(simp,[status(thm)],[13]) ).
thf(4,plain,
sk1 != sk2,
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[4]) ).
thf(17,plain,
$false,
inference(simplifyReflect,[status(thm)],[15,6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU934^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 17:25:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.97/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.12/0.99 % [INFO] Parsing done (125ms).
% 1.12/1.00 % [INFO] Running in sequential loop mode.
% 1.54/1.27 % [INFO] nitpick registered as external prover.
% 1.54/1.28 % [INFO] Scanning for conjecture ...
% 1.76/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.76/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 1.76/1.36 % [INFO] Type checking passed.
% 1.76/1.36 % [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 ...
% 2.35/1.62 % [INFO] Killing All external provers ...
% 2.35/1.62 % Time passed: 1120ms (effective reasoning time: 620ms)
% 2.35/1.62 % 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)>
% 2.35/1.63 % Axioms used in derivation (0):
% 2.35/1.63 % No. of inferences in proof: 12
% 2.35/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1120 ms resp. 620 ms w/o parsing
% 2.35/1.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.35/1.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------