%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 : Tue Sep 29 11:49:15 AM UTC 2026
% Result : Unsatisfiable 1.07s 0.69s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 3 RR)
% Number of literals : 34 ( 33 equ; 1 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 : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 69 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c2,axiom,
ifeq(A,A,B,C) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c3,plain,
ifeq(true,true,theorem(or(not(X3),or(X3,X2))),true) = theorem(or(not(X3),or(X3,X2))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
theorem(or(not(X3),or(X3,X2))) = ifeq(true,true,theorem(or(not(X3),or(X3,X2))),true),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
ifeq(true,true,theorem(or(not(or(X3,X2)),or(X2,X3))),true) = theorem(or(not(or(X3,X2)),or(X2,X3))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c6,plain,
theorem(or(not(or(X3,X2)),or(X2,X3))) = ifeq(true,true,theorem(or(not(or(X3,X2)),or(X2,X3))),true),
inference(symmetry,[status(thm)],[c5]) ).
cnf(c7,axiom,
axiom(or(not(or(A2,B2)),or(B2,A2))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(c8,plain,
axiom(or(not(or(X3,X2)),or(X2,X3))) = true,
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
true = axiom(or(not(or(X3,X2)),or(X2,X3))),
inference(symmetry,[status(thm)],[c8]) ).
cnf(c10,plain,
ifeq(true,true,theorem(or(not(or(X3,X2)),or(X2,X3))),true) = ifeq(axiom(or(not(or(X3,X2)),or(X2,X3))),true,theorem(or(not(or(X3,X2)),or(X2,X3))),true),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(c12,plain,
ifeq(axiom(or(not(or(X3,X2)),or(X2,X3))),true,theorem(or(not(or(X3,X2)),or(X2,X3))),true) = true,
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
ifeq(true,true,theorem(or(not(or(X3,X2)),or(X2,X3))),true) = true,
inference(transitivity,[status(thm)],[c10,c12]) ).
cnf(c14,plain,
theorem(or(not(or(X3,X2)),or(X2,X3))) = true,
inference(transitivity,[status(thm)],[c6,c13]) ).
cnf(c15,plain,
theorem(or(not(or(X2,X3)),or(X3,X2))) = true,
inference(substitution,[status(thm)],[c14]) ).
cnf(c16,plain,
true = theorem(or(not(or(X2,X3)),or(X3,X2))),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c17,plain,
ifeq(true,true,theorem(or(not(X3),or(X3,X2))),true) = ifeq(theorem(or(not(or(X2,X3)),or(X3,X2))),true,theorem(or(not(X3),or(X3,X2))),true),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
ifeq(true,true,theorem(or(not(X2),X3)),true) = theorem(or(not(X2),X3)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c19,plain,
theorem(or(not(X3),X2)) = ifeq(true,true,theorem(or(not(X3),X2)),true),
inference(symmetry,[status(thm)],[c18]) ).
cnf(c20,plain,
ifeq(theorem(or(not(or(X4,X3)),X2)),true,theorem(or(not(X3),X2)),true) = ifeq(theorem(or(not(or(X4,X3)),X2)),true,ifeq(true,true,theorem(or(not(X3),X2)),true),true),
inference(congruence,[status(thm)],[c19]) ).
cnf(c21,axiom,
axiom(or(not(A2),or(B2,A2))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(c22,plain,
axiom(or(not(X2),or(X3,X2))) = true,
inference(substitution,[status(thm)],[c21]) ).
cnf(c23,plain,
true = axiom(or(not(X2),or(X3,X2))),
inference(symmetry,[status(thm)],[c22]) ).
cnf(c24,plain,
ifeq(true,true,theorem(or(not(X3),X2)),true) = ifeq(axiom(or(not(X3),or(X4,X3))),true,theorem(or(not(X3),X2)),true),
inference(congruence,[status(thm)],[c23]) ).
cnf(c25,plain,
ifeq(theorem(or(not(or(X4,X3)),X2)),true,ifeq(true,true,theorem(or(not(X3),X2)),true),true) = ifeq(theorem(or(not(or(X4,X3)),X2)),true,ifeq(axiom(or(not(X3),or(X4,X3))),true,theorem(or(not(X3),X2)),true),true),
inference(congruence,[status(thm)],[c24]) ).
cnf(c26,axiom,
ifeq(theorem(or(not(Y),Z)),true,ifeq(axiom(or(not(X2),Y)),true,theorem(or(not(X2),Z)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
cnf(c27,plain,
ifeq(theorem(or(not(or(X4,X3)),X2)),true,ifeq(axiom(or(not(X3),or(X4,X3))),true,theorem(or(not(X3),X2)),true),true) = true,
inference(substitution,[status(thm)],[c26]) ).
cnf(c28,plain,
ifeq(theorem(or(not(or(X4,X3)),X2)),true,ifeq(true,true,theorem(or(not(X3),X2)),true),true) = true,
inference(transitivity,[status(thm)],[c25,c27]) ).
cnf(c29,plain,
ifeq(theorem(or(not(or(X4,X3)),X2)),true,theorem(or(not(X3),X2)),true) = true,
inference(transitivity,[status(thm)],[c20,c28]) ).
cnf(c30,plain,
ifeq(theorem(or(not(or(X2,X3)),or(X3,X2))),true,theorem(or(not(X3),or(X3,X2))),true) = true,
inference(substitution,[status(thm)],[c29]) ).
cnf(c31,plain,
ifeq(true,true,theorem(or(not(X3),or(X3,X2))),true) = true,
inference(transitivity,[status(thm)],[c17,c30]) ).
cnf(c32,plain,
theorem(or(not(X3),or(X3,X2))) = true,
inference(transitivity,[status(thm)],[c4,c31]) ).
cnf(c33,plain,
theorem(or(not(not(p)),or(not(p),q))) = true,
inference(substitution,[status(thm)],[c32]) ).
cnf(c34,plain,
$false,
inference(resolution,[status(thm)],[c1,c33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n009.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 27 15:25:29 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/0.69 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 1.07/0.69
% 1.07/0.69 % SZS status Unsatisfiable
% 1.07/0.69
% 1.07/0.70 % SZS output start CNFRefutation
% See solution above
% 1.45/0.72
% 1.45/0.72 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------