%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC276-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 : n017.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:52 PM UTC 2026
% Result : Unsatisfiable 25.60s 4.19s
% Output : Proof 25.60s
% 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(f196,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f196_nnf,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(nnf_transformation,[status(thm)],[f196]) ).
fof(f196_sk,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(skolemisation,[status(esa)],[f196_nnf]) ).
cnf(c196,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(cnf_transformation,[status(esa)],[f196_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(p200,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(p202,plain,
( ~ totalorderedP(nil)
| ssItem(sk5) ),
inference(superposition,[status(thm)],[p200,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(p209,plain,
ssItem(sk5),
inference(resolution,[status(thm)],[p202,c3]) ).
cnf(p548,plain,
totalorderedP(cons(sk5,nil)),
inference(resolution,[status(thm)],[c66,p209]) ).
cnf(p566,plain,
( totalorderedP(sk3)
| nil = sk3 ),
inference(superposition,[status(thm)],[c196,p548]) ).
cnf(p703,plain,
( sk1 = nil
| totalorderedP(sk3) ),
inference(superposition,[status(thm)],[p566,c190]) ).
cnf(p1084,plain,
( ~ totalorderedP(nil)
| totalorderedP(sk1) ),
inference(superposition,[status(thm)],[p703,c191]) ).
cnf(p1086,plain,
totalorderedP(sk1),
inference(resolution,[status(thm)],[p1084,c3]) ).
cnf(p1087,plain,
$false,
inference(resolution,[status(thm)],[p1086,c191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC276-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n017.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 17:17:32 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.60/4.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.60/4.19 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------