TSTP Solution File: SET017^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SET017^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.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:04:52 EDT 2024
% Result : Theorem 2.86s 1.64s
% Output : Refutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 10 unt; 4 typ; 1 def)
% Number of atoms : 65 ( 59 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 11 ~; 26 |; 0 &; 8 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-3 aty)
% Number of variables : 25 ( 9 ^ 16 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(unord_pair_type,type,
unord_pair: $i > $i > $i > $o ).
thf(unord_pair_def,definition,
( unord_pair
= ( ^ [A: $i,B: $i,C: $i] :
( ( C = A )
| ( C = B ) ) ) ) ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( unord_pair @ A @ B )
= ( unord_pair @ A @ C ) )
=> ( B = C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( unord_pair @ A @ B )
= ( unord_pair @ A @ C ) )
=> ( B = C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( ^ [D: $i] :
( ( D = A )
| ( D = B ) ) )
= ( ^ [D: $i] :
( ( D = A )
| ( D = C ) ) ) )
=> ( B = C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( ^ [A: $i] :
( ( A = sk1 )
| ( A = sk2 ) ) )
= ( ^ [A: $i] :
( ( A = sk1 )
| ( A = sk3 ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( ^ [A: $i] :
( ( A = sk1 )
| ( A = sk3 ) ) )
= ( ^ [A: $i] :
( ( A = sk1 )
| ( A = sk2 ) ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(8,plain,
! [A: $i] :
( ( ( A = sk1 )
| ( A = sk3 ) )
= ( ( A = sk1 )
| ( A = sk2 ) ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(12,plain,
! [A: $i] :
( ( A = sk1 )
| ( A = sk3 )
| ~ ( ( A = sk1 )
| ( A = sk2 ) ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(19,plain,
! [A: $i] :
( ( A != sk2 )
| ( A = sk1 )
| ( A = sk3 ) ),
inference(cnf,[status(esa)],[12]) ).
thf(21,plain,
! [A: $i] :
( ( A != sk2 )
| ( A = sk1 )
| ( A = sk3 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(22,plain,
( ( sk2 = sk1 )
| ( sk3 = sk2 ) ),
inference(simp,[status(thm)],[21]) ).
thf(11,plain,
! [A: $i] :
( ~ ( ( A = sk1 )
| ( A = sk3 ) )
| ( A = sk1 )
| ( A = sk2 ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(14,plain,
! [A: $i] :
( ( A = sk1 )
| ( A = sk2 )
| ( A != sk3 ) ),
inference(cnf,[status(esa)],[11]) ).
thf(17,plain,
! [A: $i] :
( ( A = sk1 )
| ( A = sk2 )
| ( A != sk3 ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(18,plain,
( ( sk3 = sk1 )
| ( sk3 = sk2 ) ),
inference(simp,[status(thm)],[17]) ).
thf(4,plain,
sk2 != sk3,
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
sk3 != sk2,
inference(lifteq,[status(thm)],[4]) ).
thf(25,plain,
sk3 = sk1,
inference(simplifyReflect,[status(thm)],[18,6]) ).
thf(29,plain,
( ( sk2 = sk1 )
| ( sk2 = sk1 ) ),
inference(rewrite,[status(thm)],[22,25]) ).
thf(30,plain,
sk2 = sk1,
inference(simp,[status(thm)],[29]) ).
thf(26,plain,
sk2 != sk1,
inference(rewrite,[status(thm)],[6,25]) ).
thf(31,plain,
$false,
inference(simplifyReflect,[status(thm)],[30,26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET017^1 : TPTP v8.2.0. Released v3.6.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 12:39:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.91/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.34/0.98 % [INFO] Parsing done (128ms).
% 1.34/0.99 % [INFO] Running in sequential loop mode.
% 1.71/1.21 % [INFO] nitpick registered as external prover.
% 1.71/1.22 % [INFO] Scanning for conjecture ...
% 1.91/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.91/1.31 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.91/1.31 % [INFO] Problem is higher-order (TPTP THF).
% 1.91/1.31 % [INFO] Type checking passed.
% 1.91/1.31 % [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.86/1.64 % [INFO] Killing All external provers ...
% 2.86/1.64 % Time passed: 1127ms (effective reasoning time: 652ms)
% 2.86/1.64 % 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.86/1.64 % Axioms used in derivation (0):
% 2.86/1.64 % No. of inferences in proof: 21
% 2.86/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1127 ms resp. 652 ms w/o parsing
% 2.86/1.67 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.86/1.67 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------