%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWX200-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 : n013.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:42 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 7 RR)
% Number of literals : 24 ( 23 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 33 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_015,axiom,
prop_merge_ord_not3(X1,X2) = impl(eq2(ord(X1),btrue),impl(eq2(ord(X2),bfalse),eq2(ord(merge(X1,X2)),btrue))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_007,axiom,
merge(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_010,axiom,
ord(nil) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_022,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_022) ).
cnf(axiom_013,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
cnf(axiom_012,axiom,
ord(cons(X1,cons(X2,X3))) = aux2(X1,X2,X3,leqNat(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_012) ).
cnf(axiom_005,axiom,
leqNat(s(X1),z) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_003,axiom,
aux2(X1,X2,X3,bfalse) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_016,axiom,
eq2(bfalse,btrue) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).
cnf(goal,negated_conjecture,
eq2(prop_merge_ord_not3(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_10,axiom,
prop_merge_ord_not3(X1,X2) = impl(eq2(ord(X1),btrue),impl(eq2(ord(X2),bfalse),eq2(ord(merge(X1,X2)),btrue))),
axiom_015 ).
cnf(c_0_11,axiom,
merge(nil,X1) = X1,
axiom_007 ).
cnf(c_0_12,axiom,
ord(nil) = btrue,
axiom_010 ).
cnf(c_0_13,axiom,
eq2(X1,X1) = btrue,
axiom_022 ).
cnf(c_0_14,axiom,
impl(btrue,X1) = X1,
axiom_013 ).
cnf(c_0_15,axiom,
ord(cons(X1,cons(X2,X3))) = aux2(X1,X2,X3,leqNat(X1,X2)),
axiom_012 ).
cnf(c_0_16,axiom,
leqNat(s(X1),z) = bfalse,
axiom_005 ).
cnf(c_0_17,axiom,
aux2(X1,X2,X3,bfalse) = bfalse,
axiom_003 ).
cnf(c_0_18,plain,
impl(eq2(ord(X1),bfalse),eq2(ord(X1),btrue)) = prop_merge_ord_not3(nil,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
ord(cons(s(X1),cons(z,X2))) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,axiom,
eq2(bfalse,btrue) = bfalse,
axiom_016 ).
cnf(c_0_21,negated_conjecture,
eq2(prop_merge_ord_not3(X1,X2),bfalse) != btrue,
goal ).
cnf(c_0_22,plain,
prop_merge_ord_not3(nil,cons(s(X1),cons(z,X2))) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_20]),c_0_14]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n013.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 07:55:56 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------