%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Thu Sep 24 01:12:00 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 equ; 3 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 : 29 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_3,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_6,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
rule_3 ).
cnf(c_0_7,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_8,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_11,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_12,plain,
ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_13,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
c_0_11 ).
cnf(c_0_15,plain,
theorem(or(not(X1),or(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:04:57 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 988920 completed with status 0
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FUUPM-FFSF31-MFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 226s (1) cores
% 0.12/0.45 % Starting new_bool_3 with 226s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 226s (1) cores
% 0.12/0.45 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 988928 completed with status 0
% 0.12/0.45 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FUUPM-FFSF31-MFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 226s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.46 % Parsed axioms : 10
% 0.12/0.46 % Removed by relevancy pruning/SinE : 0
% 0.12/0.46 % Initial clauses : 10
% 0.12/0.46 % Removed in clause preprocessing : 0
% 0.12/0.46 % Initial clauses in saturation : 10
% 0.12/0.46 % Processed clauses : 49
% 0.12/0.46 % ...of these trivial : 3
% 0.12/0.46 % ...subsumed : 0
% 0.12/0.46 % ...remaining for further processing : 46
% 0.12/0.46 % Other redundant clauses eliminated : 0
% 0.12/0.46 % Clauses deleted for lack of memory : 0
% 0.12/0.46 % Backward-subsumed : 0
% 0.12/0.46 % Backward-rewritten : 1
% 0.12/0.46 % Generated clauses : 470
% 0.12/0.46 % ...of the previous two non-redundant : 225
% 0.12/0.46 % ...aggressively subsumed : 0
% 0.12/0.46 % Contextual simplify-reflections : 0
% 0.12/0.46 % Paramodulations : 470
% 0.12/0.46 % Factorizations : 0
% 0.12/0.46 % NegExts : 0
% 0.12/0.46 % Equation resolutions : 0
% 0.12/0.46 % Disequality decompositions : 0
% 0.12/0.46 % Total rewrite steps : 522
% 0.12/0.46 % ...of those cached : 204
% 0.12/0.46 % Propositional unsat checks : 0
% 0.12/0.46 % Propositional check models : 0
% 0.12/0.46 % Propositional check unsatisfiable : 0
% 0.12/0.46 % Propositional clauses : 0
% 0.12/0.46 % Propositional clauses after purity: 0
% 0.12/0.46 % Propositional unsat core size : 0
% 0.12/0.46 % Propositional preprocessing time : 0.000
% 0.12/0.46 % Propositional encoding time : 0.000
% 0.12/0.46 % Propositional solver time : 0.000
% 0.12/0.46 % Success case prop preproc time : 0.000
% 0.12/0.46 % Success case prop encoding time : 0.000
% 0.12/0.46 % Success case prop solver time : 0.000
% 0.12/0.46 % Current number of processed clauses : 45
% 0.12/0.46 % Positive orientable unit clauses : 45
% 0.12/0.46 % Positive unorientable unit clauses: 0
% 0.12/0.46 % Negative unit clauses : 0
% 0.12/0.46 % Non-unit-clauses : 0
% 0.12/0.46 % Current number of unprocessed clauses: 186
% 0.12/0.46 % ...number of literals in the above : 186
% 0.12/0.46 % Current number of archived formulas : 0
% 0.12/0.46 % Current number of archived clauses : 1
% 0.12/0.46 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.46 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.46 % Non-unit clause-clause subsumptions : 0
% 0.12/0.46 % Unit Clause-clause subsumption calls : 0
% 0.12/0.46 % Rewrite failures with RHS unbound : 0
% 0.12/0.46 % BW rewrite match attempts : 228
% 0.12/0.46 % BW rewrite match successes : 1
% 0.12/0.46 % Condensation attempts : 0
% 0.12/0.46 % Condensation successes : 0
% 0.12/0.46 % Termbank termtop insertions : 6903
% 0.12/0.46 % Search garbage collected termcells : 2
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.008 s
% 0.12/0.46 % System time : 0.004 s
% 0.12/0.46 % Total time : 0.012 s
% 0.12/0.46 % Maximum resident set size: 3640 pages
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.043 s
% 0.12/0.46 % System time : 0.017 s
% 0.12/0.46 % Total time : 0.060 s
% 0.12/0.46 % Maximum resident set size: 4608 pages
% 0.12/0.46 % E exiting
%------------------------------------------------------------------------------