%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC277-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 : Sun Sep 27 08:54:50 AM UTC 2026
% Result : Unsatisfiable 46.31s 6.35s
% Output : CNFRefutation 46.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 20 unt; 8 nHn; 38 RR)
% Number of literals : 75 ( 13 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_3,negated_conjecture,
ssList(sk3) ).
cnf(co1_4,negated_conjecture,
ssList(sk4) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3 ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3) ).
cnf(co1_8,negated_conjecture,
~ totalorderedP(sk1) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ) ).
cnf(clause4,axiom,
totalorderedP(nil) ).
cnf(clause8,axiom,
ssList(nil) ).
cnf(clause47,axiom,
ssItem(skaf44(X0)) ).
cnf(clause67,axiom,
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ).
cnf(clause80,axiom,
( nil = X0
| ~ ssList(X0)
| ~ segmentP(nil,X0) ) ).
cnf(clause100,axiom,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ) ).
cnf(clause101,axiom,
( cons(skaf44(X0),nil) = X0
| ~ ssList(X0)
| ~ singletonP(X0) ) ).
cnf(c2,plain,
ssList(sk3),
inference(clausification,[status(esa)],[co1_3]) ).
cnf(c3,plain,
ssList(sk4),
inference(clausification,[status(esa)],[co1_4]) ).
cnf(c5,plain,
sk1 = sk3,
inference(clausification,[status(esa)],[co1_6]) ).
cnf(c6,plain,
segmentP(sk4,sk3),
inference(clausification,[status(esa)],[co1_7]) ).
cnf(c7,plain,
~ totalorderedP(sk1),
inference(clausification,[status(esa)],[co1_8]) ).
cnf(c8,plain,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(clausification,[status(esa)],[co1_9]) ).
cnf(c12,plain,
totalorderedP(nil),
inference(clausification,[status(esa)],[clause4]) ).
cnf(c16,plain,
ssList(nil),
inference(clausification,[status(esa)],[clause8]) ).
cnf(c55,plain,
ssItem(skaf44(X0)),
inference(clausification,[status(esa)],[clause47]) ).
cnf(c75,plain,
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[clause67]) ).
cnf(c88,plain,
( nil = X0
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(clausification,[status(esa)],[clause80]) ).
cnf(c108,plain,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause100]) ).
cnf(c109,plain,
( cons(skaf44(X0),nil) = X0
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(clausification,[status(esa)],[clause101]) ).
cnf(d0,plain,
~ totalorderedP(sk3),
inference(demodulation,[status(thm)],[c7,c5]) ).
cnf(d1,plain,
( singletonP(sk3)
| ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil ),
inference(resolution,[status(thm)],[c108,c8]) ).
cnf(d2,plain,
( singletonP(sk3)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d1]) ).
cnf(d3,plain,
( singletonP(sk3)
| sk4 = nil ),
inference(resolution,[status(thm)],[c16,d2]) ).
cnf(d4,plain,
( singletonP(sk3)
| segmentP(nil,sk3) ),
inference(superposition,[status(thm)],[d3,c6]) ).
cnf(d5,plain,
( ~ ssList(sk3)
| nil = sk3
| singletonP(sk3) ),
inference(resolution,[status(thm)],[d4,c88]) ).
cnf(d6,plain,
( singletonP(sk3)
| nil = sk3 ),
inference(resolution,[status(thm)],[c2,d5]) ).
cnf(d7,plain,
( singletonP(sk3)
| ~ totalorderedP(nil) ),
inference(superposition,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
singletonP(sk3),
inference(resolution,[status(thm)],[c12,d7]) ).
cnf(d9,plain,
( ~ singletonP(X0)
| ~ ssList(X0)
| ~ ssItem(skaf44(X0))
| totalorderedP(X0) ),
inference(superposition,[status(thm)],[c109,c75]) ).
cnf(d10,plain,
( ~ singletonP(X0)
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c55,d9]) ).
cnf(d11,plain,
( totalorderedP(sk3)
| ~ ssList(sk3) ),
inference(resolution,[status(thm)],[d10,d8]) ).
cnf(d12,plain,
totalorderedP(sk3),
inference(resolution,[status(thm)],[c2,d11]) ).
cnf(d13,plain,
$false,
inference(resolution,[status(thm)],[d0,d12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC277-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 % Computer : n005.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sat Sep 26 12:40:47 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.31/6.35 % SZS status Unsatisfiable for theBenchmark.p
% 46.31/6.35 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------