%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC259-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:05:49 PM UTC 2026
% Result : Unsatisfiable 29.02s 4.80s
% Output : Proof 29.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 48 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 10 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f202,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f202_nnf,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(nnf_transformation,[status(thm)],[f202]) ).
fof(f202_sk,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(skolemisation,[status(esa)],[f202_nnf]) ).
cnf(c202,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(cnf_transformation,[status(esa)],[f202_sk]) ).
cnf(f66,axiom,
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause67) ).
fof(f66_nnf,plain,
! [U] :
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f66]) ).
fof(f66_sk,plain,
! [U] :
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f66_nnf]) ).
cnf(c66,plain,
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f66_sk]) ).
cnf(f190,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f190_nnf,plain,
sk1 = sk3,
inference(nnf_transformation,[status(thm)],[f190]) ).
cnf(c190,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f190_nnf]) ).
cnf(f193,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f193_nnf,plain,
( nil = sk3
| ssItem(sk5) ),
inference(nnf_transformation,[status(thm)],[f193]) ).
fof(f193_sk,plain,
( nil = sk3
| ssItem(sk5) ),
inference(skolemisation,[status(esa)],[f193_nnf]) ).
cnf(c193,plain,
( nil = sk3
| ssItem(sk5) ),
inference(cnf_transformation,[status(esa)],[f193_sk]) ).
cnf(p220,plain,
( nil = sk1
| ssItem(sk5) ),
inference(superposition,[status(thm)],[c190,c193]) ).
cnf(f191,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f191_nnf,plain,
~ totalorderedP(sk1),
inference(nnf_transformation,[status(thm)],[f191]) ).
fof(f191_sk,plain,
~ totalorderedP(sk1),
inference(skolemisation,[status(esa)],[f191_nnf]) ).
cnf(c191,plain,
~ totalorderedP(sk1),
inference(cnf_transformation,[status(esa)],[f191_sk]) ).
cnf(p221,plain,
( ~ totalorderedP(nil)
| ssItem(sk5) ),
inference(superposition,[status(thm)],[p220,c191]) ).
cnf(f3,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
fof(f3_nnf,plain,
totalorderedP(nil),
inference(nnf_transformation,[status(thm)],[f3]) ).
cnf(c3,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f3_nnf]) ).
cnf(p222,plain,
ssItem(sk5),
inference(resolution,[status(thm)],[p221,c3]) ).
cnf(p610,plain,
totalorderedP(cons(sk5,nil)),
inference(resolution,[status(thm)],[c66,p222]) ).
cnf(p676,plain,
( totalorderedP(sk3)
| nil = sk3 ),
inference(superposition,[status(thm)],[c202,p610]) ).
cnf(p1053,plain,
( sk1 = nil
| totalorderedP(sk1) ),
inference(superposition,[status(thm)],[p676,c190]) ).
cnf(p1239,plain,
( ~ totalorderedP(nil)
| totalorderedP(sk1) ),
inference(superposition,[status(thm)],[p1053,c191]) ).
cnf(p1240,plain,
totalorderedP(sk1),
inference(resolution,[status(thm)],[p1239,c3]) ).
cnf(p1241,plain,
$false,
inference(resolution,[status(thm)],[p1240,c191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC259-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.42 % Computer : n003.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.13/0.42 % CPULimit : 300
% 0.13/0.42 % WCLimit : 300
% 0.13/0.43 % DateTime : Thu Sep 24 17:18:22 UTC 2026
% 0.13/0.43 % CPUTime :
% 0.13/0.43 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 29.02/4.80 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.02/4.80 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------