TSTP Solution File: SWC006+1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.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 7 10:55:48 EDT 2024
% Result : Theorem 7.63s 3.01s
% Output : Refutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 85 ( 36 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 229 ( 43 ~; 36 |; 12 &; 123 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 30 !; 9 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(ssList_type,type,
ssList: $i > $o ).
thf(app_type,type,
app: $i > $i > $i ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(sk6_type,type,
sk6: $i ).
thf(sk7_type,type,
sk7: $i ).
thf(1,conjecture,
! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ~ ( ssList @ D )
| ( B != D )
| ( A != C )
| ? [E: $i] :
( ( ssList @ E )
& ? [F: $i] :
( ( ssList @ F )
& ? [G: $i] :
( ( ssList @ G )
& ( ( app @ ( app @ E @ F ) @ G )
= B )
& ( ( app @ E @ G )
= A ) ) ) )
| ! [E: $i] :
( ( ssList @ E )
=> ! [F: $i] :
( ( ssList @ F )
=> ! [G: $i] :
( ~ ( ssList @ G )
| ( ( app @ ( app @ E @ F ) @ G )
!= D )
| ( ( app @ E @ G )
!= C ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ~ ( ssList @ D )
| ( B != D )
| ( A != C )
| ? [E: $i] :
( ( ssList @ E )
& ? [F: $i] :
( ( ssList @ F )
& ? [G: $i] :
( ( ssList @ G )
& ( ( app @ ( app @ E @ F ) @ G )
= B )
& ( ( app @ E @ G )
= A ) ) ) )
| ! [E: $i] :
( ( ssList @ E )
=> ! [F: $i] :
( ( ssList @ F )
=> ! [G: $i] :
( ~ ( ssList @ G )
| ( ( app @ ( app @ E @ F ) @ G )
!= D )
| ( ( app @ E @ G )
!= C ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(98,plain,
~ ! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ~ ( ssList @ D )
| ( B != D )
| ( A != C )
| ? [E: $i] :
( ( ssList @ E )
& ? [F: $i] :
( ( ssList @ F )
& ? [G: $i] :
( ( ssList @ G )
& ( ( app @ ( app @ E @ F ) @ G )
= B )
& ( ( app @ E @ G )
= A ) ) ) )
| ! [E: $i] :
( ( ssList @ E )
=> ! [F: $i] :
( ( ssList @ F )
=> ! [G: $i] :
( ~ ( ssList @ G )
| ( ( app @ ( app @ E @ F ) @ G )
!= D )
| ( ( app @ E @ G )
!= C ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(110,plain,
( ( app @ ( app @ sk5 @ sk6 ) @ sk7 )
= sk4 ),
inference(cnf,[status(esa)],[98]) ).
thf(111,plain,
( ( app @ ( app @ sk5 @ sk6 ) @ sk7 )
= sk4 ),
inference(lifteq,[status(thm)],[110]) ).
thf(104,plain,
sk2 = sk4,
inference(cnf,[status(esa)],[98]) ).
thf(115,plain,
sk4 = sk2,
inference(lifteq,[status(thm)],[104]) ).
thf(510,plain,
( ( app @ ( app @ sk5 @ sk6 ) @ sk7 )
= sk2 ),
inference(rewrite,[status(thm)],[111,115]) ).
thf(109,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( ssList @ A )
| ~ ( ssList @ B )
| ~ ( ssList @ C )
| ( ( app @ ( app @ A @ B ) @ C )
!= sk2 )
| ( ( app @ A @ C )
!= sk1 ) ),
inference(cnf,[status(esa)],[98]) ).
thf(112,plain,
! [C: $i,B: $i,A: $i] :
( ( ( app @ ( app @ A @ B ) @ C )
!= sk2 )
| ( ( app @ A @ C )
!= sk1 )
| ~ ( ssList @ A )
| ~ ( ssList @ B )
| ~ ( ssList @ C ) ),
inference(lifteq,[status(thm)],[109]) ).
thf(555,plain,
! [C: $i,B: $i,A: $i] :
( ( ( app @ A @ C )
!= sk1 )
| ~ ( ssList @ A )
| ~ ( ssList @ B )
| ~ ( ssList @ C )
| ( ( app @ ( app @ sk5 @ sk6 ) @ sk7 )
!= ( app @ ( app @ A @ B ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[510,112]) ).
thf(556,plain,
( ( ( app @ sk5 @ sk7 )
!= sk1 )
| ~ ( ssList @ sk5 )
| ~ ( ssList @ sk6 )
| ~ ( ssList @ sk7 ) ),
inference(pattern_uni,[status(thm)],[555:[bind(A,$thf( sk5 )),bind(B,$thf( sk6 )),bind(C,$thf( sk7 ))]]) ).
thf(99,plain,
ssList @ sk7,
inference(cnf,[status(esa)],[98]) ).
thf(105,plain,
ssList @ sk5,
inference(cnf,[status(esa)],[98]) ).
thf(106,plain,
ssList @ sk6,
inference(cnf,[status(esa)],[98]) ).
thf(100,plain,
( ( app @ sk5 @ sk7 )
= sk3 ),
inference(cnf,[status(esa)],[98]) ).
thf(113,plain,
( ( app @ sk5 @ sk7 )
= sk3 ),
inference(lifteq,[status(thm)],[100]) ).
thf(103,plain,
sk1 = sk3,
inference(cnf,[status(esa)],[98]) ).
thf(114,plain,
sk3 = sk1,
inference(lifteq,[status(thm)],[103]) ).
thf(511,plain,
( ( app @ sk5 @ sk7 )
= sk1 ),
inference(rewrite,[status(thm)],[113,114]) ).
thf(649,plain,
( ( sk1 != sk1 )
| ~ $true
| ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[556,99,105,106,511]) ).
thf(650,plain,
$false,
inference(simp,[status(thm)],[649]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% 0.16/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 6 23:44:39 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.96/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.53/1.04 % [INFO] Parsing done (172ms).
% 1.53/1.05 % [INFO] Running in sequential loop mode.
% 1.97/1.27 % [INFO] nitpick registered as external prover.
% 1.97/1.27 % [INFO] Scanning for conjecture ...
% 2.26/1.36 % [INFO] Found a conjecture and 95 axioms. Running axiom selection ...
% 2.26/1.43 % [INFO] Axiom selection finished. Selected 95 axioms (removed 0 axioms).
% 2.70/1.52 % [INFO] Problem is first-order (TPTP FOF).
% 2.70/1.53 % [INFO] Type checking passed.
% 2.70/1.54 % [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 ...
% 7.37/3.00 % [INFO] Killing All external provers ...
% 7.63/3.00 % Time passed: 2457ms (effective reasoning time: 1944ms)
% 7.63/3.00 % 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)>
% 7.63/3.01 % Axioms used in derivation (0):
% 7.63/3.01 % No. of inferences in proof: 22
% 7.63/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2457 ms resp. 1944 ms w/o parsing
% 7.63/3.04 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.63/3.04 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------