%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL203-10 : TPTP v9.2.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n007.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 04:39:42 PM UTC 2026
% Result : Unsatisfiable 6.29s 4.54s
% Output : CNFRefutation 6.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 4 RR)
% Number of literals : 47 ( 46 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 93 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_10,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_11,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_12,axiom,
axiom(implies(or(X1,X1),X1)) = true,
axiom_1_2 ).
cnf(c_0_13,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_14,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_15,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_17,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,X1)),X1)) = true,
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_20,plain,
ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
inference(rw,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_21,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_23,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,X1)),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_16]) ).
cnf(c_0_26,plain,
ifeq(theorem(or(X1,or(X2,X3))),true,theorem(or(X2,or(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]) ).
cnf(c_0_27,plain,
theorem(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_16]) ).
cnf(c_0_28,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_29,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_16]) ).
cnf(c_0_30,plain,
ifeq(theorem(or(X1,X1)),true,theorem(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_16]) ).
cnf(c_0_31,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]) ).
cnf(c_0_32,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_28]),c_0_16]) ).
cnf(c_0_33,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_16]) ).
cnf(c_0_34,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_35,plain,
ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(or(X3,X1)),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_16]) ).
cnf(c_0_36,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).
cnf(c_0_37,plain,
ifeq(theorem(or(not(or(not(X1),or(X2,X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_16]) ).
cnf(c_0_38,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]) ).
cnf(c_0_39,plain,
theorem(or(not(or(X1,X2)),or(X1,or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_16]) ).
cnf(c_0_40,plain,
theorem(or(not(X1),not(not(or(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_16]) ).
cnf(c_0_41,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
prove_this ).
cnf(c_0_42,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X1,or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_39]),c_0_16]) ).
cnf(c_0_43,plain,
theorem(or(not(not(or(X1,X2))),not(X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_40]),c_0_16]) ).
cnf(c_0_44,negated_conjecture,
theorem(or(not(not(or(p,q))),or(not(p),not(q)))) != true,
inference(rw,[status(thm)],[c_0_41,c_0_11]) ).
cnf(c_0_45,plain,
theorem(or(not(not(or(X1,X2))),or(X3,not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_16]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL203-10 : TPTP v9.2.1. Released v7.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n007.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 22:10:08 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 6.29/4.54 % Version : CSE_E---1.7
% 6.29/4.54 % Problem : theBenchmark.p
% 6.29/4.54 % SZS status Unsatisfiable for theBenchmark.p
% 6.29/4.54 % SZS output start CNFRefutation
% See solution above
% 6.29/4.56 % Total time : 3.371s
%------------------------------------------------------------------------------