%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC134-1 : TPTP v9.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n010.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 : Sat Jun 21 05:30:16 AM UTC 2025
% Result : Unsatisfiable 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 40 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 155 ( 35 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 180 ( 73 ~; 89 |; 0 &)
% ( 18 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 30 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
tff(cyclefreeP_type,type,
cyclefreeP: $i > $o ).
tff(nil_type,type,
nil: $i ).
tff(sk2_type,type,
sk2: $i ).
tff(sk4_type,type,
sk4: $i ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(1,plain,
( ( sk2 = sk4 )
<=> ( sk2 = sk4 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
tff(3,plain,
sk2 = sk4,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
sk4 = sk2,
inference(symmetry,[status(thm)],[3]) ).
tff(5,plain,
( ~ neq(sk4,nil)
<=> ~ neq(sk4,nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(6,axiom,
~ neq(sk4,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
tff(7,plain,
~ neq(sk4,nil),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
( ssList(sk4)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],[]) ).
tff(9,axiom,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
tff(10,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
^ [V: $i,U: $i] :
refl(( ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],[]) ).
tff(12,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[11]) ).
tff(13,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(14,plain,
^ [V: $i,U: $i] :
trans(monotonicity(rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ) )),
rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],[]) ).
tff(15,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[14]) ).
tff(16,axiom,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
tff(17,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[17,13]) ).
tff(19,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(skolemize,[status(sab)],[18]) ).
tff(20,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[19,12]) ).
tff(21,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(22,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(23,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ( sk4 = nil )
| neq(sk4,nil) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ( sk4 = nil )
| neq(sk4,nil) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(25,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ( sk4 = nil )
| neq(sk4,nil) ),
inference(quant_inst,[status(thm)],[]) ).
tff(26,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ( sk4 = nil )
| neq(sk4,nil) ),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
sk4 = nil,
inference(unit_resolution,[status(thm)],[26,23,20,10,7]) ).
tff(28,plain,
nil = sk4,
inference(symmetry,[status(thm)],[27]) ).
tff(29,plain,
nil = sk2,
inference(transitivity,[status(thm)],[28,4]) ).
tff(30,plain,
( cyclefreeP(nil)
<=> cyclefreeP(sk2) ),
inference(monotonicity,[status(thm)],[29]) ).
tff(31,plain,
( cyclefreeP(sk2)
<=> cyclefreeP(nil) ),
inference(symmetry,[status(thm)],[30]) ).
tff(32,plain,
( ~ cyclefreeP(sk2)
<=> ~ cyclefreeP(nil) ),
inference(monotonicity,[status(thm)],[31]) ).
tff(33,plain,
( ~ cyclefreeP(sk2)
<=> ~ cyclefreeP(sk2) ),
inference(rewrite,[status(thm)],[]) ).
tff(34,axiom,
~ cyclefreeP(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
tff(35,plain,
~ cyclefreeP(sk2),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
~ cyclefreeP(nil),
inference(modus_ponens,[status(thm)],[35,32]) ).
tff(37,plain,
( cyclefreeP(nil)
<=> cyclefreeP(nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(38,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause7) ).
tff(39,plain,
cyclefreeP(nil),
inference(modus_ponens,[status(thm)],[38,37]) ).
tff(40,plain,
$false,
inference(unit_resolution,[status(thm)],[39,36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC134-1 : TPTP v9.0.0. Released v2.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 20 08:28:12 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output start Proof
% See solution above
% 0.19/0.43 % E exiting
%------------------------------------------------------------------------------