%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 09:15:39 AM UTC 2026
% Result : Unsatisfiable 22.43s 3.33s
% Output : CNFRefutation 22.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 57 ( 51 unt; 0 nHn; 15 RR)
% Number of literals : 63 ( 62 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom,axiom,
impl(btrue,X0) = X0 ).
cnf(axiom_002,axiom,
append(nil,X0) = X0 ).
cnf(axiom_003,axiom,
append(cons(X0,X1),X2) = cons(X0,append(X1,X2)) ).
cnf(axiom_006,axiom,
linP(pA) = cons(a,nil) ).
cnf(axiom_008,axiom,
linP(pE) = nil ).
cnf(axiom_009,axiom,
linC(c2(X0,X1)) = append(linP(X0),linP(X1)) ).
cnf(axiom_010,axiom,
unambig(X0,X1) = impl(eq(linC(X0),linC(X1)),eq4(X0,X1)) ).
cnf(axiom_014,axiom,
eq3(pA,pE) = bfalse ).
cnf(axiom_037,axiom,
( eq4(c2(X0,X2),c2(X1,X3)) = bfalse
| eq3(X0,X1) != bfalse ) ).
cnf(axiom_039,axiom,
eq(X0,X0) = btrue ).
cnf(axiom_040,axiom,
eq2(X0,X0) = btrue ).
cnf(axiom_042,axiom,
eq4(X0,X0) = btrue ).
cnf(axiom_043,axiom,
eq5(X0,X0) = btrue ).
cnf(axiom_045,axiom,
( eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3)
| eq2(X0,X1) != btrue ) ).
cnf(goal,negated_conjecture,
eq5(unambig(X0,X1),bfalse) != btrue ).
cnf(c0,plain,
impl(btrue,X0) = X0,
inference(clausification,[status(esa)],[axiom]) ).
cnf(c2,plain,
append(nil,X0) = X0,
inference(clausification,[status(esa)],[axiom_002]) ).
cnf(c3,plain,
append(cons(X0,X1),X2) = cons(X0,append(X1,X2)),
inference(clausification,[status(esa)],[axiom_003]) ).
cnf(c6,plain,
linP(pA) = cons(a,nil),
inference(clausification,[status(esa)],[axiom_006]) ).
cnf(c8,plain,
linP(pE) = nil,
inference(clausification,[status(esa)],[axiom_008]) ).
cnf(c9,plain,
linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
inference(clausification,[status(esa)],[axiom_009]) ).
cnf(c10,plain,
unambig(X0,X1) = impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),
inference(clausification,[status(esa)],[axiom_010]) ).
cnf(c14,plain,
eq3(pA,pE) = bfalse,
inference(clausification,[status(esa)],[axiom_014]) ).
cnf(c37,plain,
( eq4(c2(X0,X2),c2(X1,X3)) = bfalse
| eq3(X0,X1) != bfalse ),
inference(clausification,[status(esa)],[axiom_037]) ).
cnf(c39,plain,
eq(X0,X0) = btrue,
inference(clausification,[status(esa)],[axiom_039]) ).
cnf(c40,plain,
eq2(X0,X0) = btrue,
inference(clausification,[status(esa)],[axiom_040]) ).
cnf(c42,plain,
eq4(X0,X0) = btrue,
inference(clausification,[status(esa)],[axiom_042]) ).
cnf(c43,plain,
eq5(X0,X0) = btrue,
inference(clausification,[status(esa)],[axiom_043]) ).
cnf(c45,plain,
( eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3)
| eq2(X0,X1) != btrue ),
inference(clausification,[status(esa)],[axiom_045]) ).
cnf(c48,plain,
eq5(unambig(X0,X1),bfalse) != btrue,
inference(clausification,[status(esa)],[goal]) ).
cnf(d0,plain,
linC(c2(pE,X0)) = append(nil,linP(X0)),
inference(superposition,[status(thm)],[c8,c9]) ).
cnf(d1,plain,
linC(c2(pE,X0)) = linP(X0),
inference(demodulation,[status(thm)],[d0,c2]) ).
cnf(d2,plain,
append(linP(pA),X0) = cons(a,append(nil,X0)),
inference(superposition,[status(thm)],[c6,c3]) ).
cnf(d3,plain,
append(linP(pA),X0) = cons(a,X0),
inference(demodulation,[status(thm)],[d2,c2]) ).
cnf(d4,plain,
linC(c2(X0,pE)) = append(linP(X0),nil),
inference(superposition,[status(thm)],[c8,c9]) ).
cnf(d5,plain,
unambig(c2(X0,pE),X1) = impl(eq(append(linP(X0),nil),linC(X1)),eq4(c2(X0,pE),X1)),
inference(superposition,[status(thm)],[d4,c10]) ).
cnf(d6,plain,
( eq4(c2(pA,X0),c2(pE,X1)) = bfalse
| bfalse != bfalse ),
inference(superposition,[status(thm)],[c14,c37]) ).
cnf(d7,plain,
eq4(c2(pA,X0),c2(pE,X1)) = bfalse,
inference(equality_resolution,[status(thm)],[d6]) ).
cnf(d8,plain,
unambig(c2(pA,pE),c2(pE,X0)) = impl(eq(append(linP(pA),nil),linC(c2(pE,X0))),bfalse),
inference(superposition,[status(thm)],[d7,d5]) ).
cnf(d9,plain,
unambig(c2(pA,pE),c2(pE,X0)) = impl(eq(cons(a,nil),linC(c2(pE,X0))),bfalse),
inference(demodulation,[status(thm)],[d8,d3]) ).
cnf(d10,plain,
unambig(c2(pA,pE),c2(pE,X0)) = impl(eq(linP(pA),linC(c2(pE,X0))),bfalse),
inference(demodulation,[status(thm)],[d9,c6]) ).
cnf(d11,plain,
unambig(c2(pA,pE),c2(pE,X0)) = impl(eq(linP(pA),linP(X0)),bfalse),
inference(demodulation,[status(thm)],[d10,d1]) ).
cnf(d12,plain,
eq5(impl(eq(linP(pA),linP(X0)),bfalse),bfalse) != btrue,
inference(superposition,[status(thm)],[d11,c48]) ).
cnf(d13,plain,
( eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2)
| btrue != btrue ),
inference(superposition,[status(thm)],[c40,c45]) ).
cnf(d14,plain,
unambig(X0,X0) = impl(btrue,eq4(X0,X0)),
inference(superposition,[status(thm)],[c39,c10]) ).
cnf(d15,plain,
unambig(X0,X0) = eq4(X0,X0),
inference(demodulation,[status(thm)],[d14,c0]) ).
cnf(d16,plain,
unambig(X0,X0) = btrue,
inference(demodulation,[status(thm)],[d15,c42]) ).
cnf(d17,plain,
unambig(X0,X0) = impl(eq(linC(X0),linC(X0)),btrue),
inference(superposition,[status(thm)],[c42,c10]) ).
cnf(d18,plain,
btrue = impl(eq(linC(X0),linC(X0)),btrue),
inference(demodulation,[status(thm)],[d17,d16]) ).
cnf(d19,plain,
btrue = impl(btrue,btrue),
inference(demodulation,[status(thm)],[d18,c39]) ).
cnf(d20,plain,
btrue = btrue,
inference(demodulation,[status(thm)],[d19,c0]) ).
cnf(d21,plain,
eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2),
inference(resolution,[status(thm)],[d20,d13]) ).
cnf(d22,plain,
btrue = eq(X1,X1),
inference(superposition,[status(thm)],[c39,d21]) ).
cnf(d23,plain,
eq5(impl(btrue,bfalse),bfalse) != btrue,
inference(superposition,[status(thm)],[d22,d12]) ).
cnf(d24,plain,
eq5(bfalse,bfalse) != btrue,
inference(demodulation,[status(thm)],[d23,c0]) ).
cnf(d25,plain,
btrue != btrue,
inference(demodulation,[status(thm)],[d24,c43]) ).
cnf(d26,plain,
$false,
inference(resolution,[status(thm)],[d20,d25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 16:58:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.43/3.33 % SZS status Unsatisfiable for theBenchmark.p
% 22.43/3.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------