%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n012.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 : Tue May 5 05:34:44 PM UTC 2026
% Result : Unsatisfiable 1.13s 1.62s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 28 unt; 0 nHn; 13 RR)
% Number of literals : 32 ( 31 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
eq5(unambig(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_010,axiom,
unambig(X1,X2) = impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_009,axiom,
linC(c2(X1,X2)) = append(linP(X1),linP(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
cnf(axiom_008,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_037,axiom,
( eq4(c2(X1,X3),c2(X2,X4)) = bfalse
| eq3(X1,X2) != bfalse ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_037) ).
cnf(axiom_018,axiom,
eq3(pE,pB) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_002,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_007,axiom,
linP(pB) = cons(b,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_003,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_039,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_039) ).
cnf(axiom,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_043,axiom,
eq5(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_043) ).
cnf(c_0_12,negated_conjecture,
eq5(unambig(X1,X2),bfalse) != btrue,
goal ).
cnf(c_0_13,axiom,
unambig(X1,X2) = impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),
axiom_010 ).
cnf(c_0_14,negated_conjecture,
eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
linC(c2(X1,X2)) = append(linP(X1),linP(X2)),
axiom_009 ).
cnf(c_0_16,negated_conjecture,
eq5(impl(eq(linC(X1),append(linP(X2),linP(X3))),eq4(X1,c2(X2,X3))),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
linP(pE) = nil,
axiom_008 ).
cnf(c_0_18,axiom,
( eq4(c2(X1,X3),c2(X2,X4)) = bfalse
| eq3(X1,X2) != bfalse ),
axiom_037 ).
cnf(c_0_19,axiom,
eq3(pE,pB) = bfalse,
axiom_018 ).
cnf(c_0_20,negated_conjecture,
eq5(impl(eq(linC(X1),append(linP(X2),nil)),eq4(X1,c2(X2,pE))),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
eq4(c2(pE,X1),c2(pB,X2)) = bfalse,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
append(nil,X1) = X1,
axiom_002 ).
cnf(c_0_23,axiom,
linP(pB) = cons(b,nil),
axiom_007 ).
cnf(c_0_24,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_003 ).
cnf(c_0_25,negated_conjecture,
eq5(impl(eq(linP(X1),cons(b,nil)),bfalse),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]),c_0_17]),c_0_22]),c_0_23]),c_0_24]),c_0_22]) ).
cnf(c_0_26,axiom,
eq(X1,X1) = btrue,
axiom_039 ).
cnf(c_0_27,axiom,
impl(btrue,X1) = X1,
axiom ).
cnf(c_0_28,axiom,
eq5(X1,X1) = btrue,
axiom_043 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_26]),c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.07 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.08/0.25 % Computer : n012.cluster.edu
% 0.08/0.25 % Model : x86_64 x86_64
% 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25 % Memory : 8042.1875MB
% 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.25 % CPULimit : 300
% 0.08/0.25 % WCLimit : 300
% 0.08/0.25 % DateTime : Tue May 5 07:56:31 EDT 2026
% 0.08/0.25 % CPUTime :
% 0.08/0.26 % start to proof: theBenchmark
% 1.13/1.62 % Version : CSE_E---1.7
% 1.13/1.62 % Problem : theBenchmark.p
% 1.13/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.62 % SZS output start CNFRefutation
% See solution above
% 1.13/1.62 % Total time : 1.362s
%------------------------------------------------------------------------------