%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS090+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:01:29 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 4 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 109 ( 46 ~; 43 |; 12 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 1 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X1] :
( cC2(X1)
=> ( ( cA(X1)
| cB(X1) )
& ( cA(X1)
| ~ cB(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cC3(X1)
=> ( ( ~ cA(X1)
| cB(X1) )
& ( ~ cA(X1)
| ~ cB(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_6,axiom,
! [X1] :
( cC5(X1)
=> ! [X2] :
( rR(X1,X2)
=> cC3(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X1] :
( cC4(X1)
=> ? [X2] :
( cC2(X2)
& rR(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
! [X1] :
( cTEST(X1)
=> ( cC5(X1)
& cC1(X1)
& cC4(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_8,axiom,
cTEST(i2003_11_14_17_19_57994),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_6,plain,
! [X1] :
( cC2(X1)
=> ( ( cA(X1)
| cB(X1) )
& ( cA(X1)
| ~ cB(X1) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_7,plain,
! [X1] :
( cC3(X1)
=> ( ( ~ cA(X1)
| cB(X1) )
& ( ~ cA(X1)
| ~ cB(X1) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
fof(c_0_8,plain,
! [X6] :
( ( ~ cC2(X6)
| cA(X6)
| cB(X6) )
& ( ~ cC2(X6)
| cA(X6)
| ~ cB(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X7] :
( ( ~ cC3(X7)
| ~ cA(X7)
| cB(X7) )
& ( ~ cC3(X7)
| ~ cA(X7)
| ~ cB(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X10,X11] :
( cC3(X11)
| ~ rR(X10,X11)
| ~ cC5(X10) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])]) ).
fof(c_0_11,plain,
! [X8] :
( ( ~ cC4(X8)
| cC2(esk1_1(X8)) )
& ( ~ cC4(X8)
| rR(X8,esk1_1(X8)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])])]) ).
cnf(c_0_12,plain,
( ~ cC2(X1)
| ~ cB(X1)
| cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ cC2(X1)
| cA(X1)
| cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ cC3(X1)
| ~ cA(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ cC3(X1)
| ~ cA(X1)
| cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ rR(X1,X2)
| ~ cC5(X1)
| cC3(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ cC4(X1)
| rR(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ cC2(X1)
| cA(X1) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ cC4(X1)
| cC2(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ cA(X1)
| ~ cC3(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ cC4(X1)
| ~ cC5(X1)
| cC3(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ cC4(X1)
| cA(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X12] :
( ( ~ cTEST(X12)
| cC5(X12) )
& ( ~ cTEST(X12)
| cC1(X12) )
& ( ~ cTEST(X12)
| cC4(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])])]) ).
cnf(c_0_24,plain,
( ~ cC4(X1)
| ~ cC5(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ cTEST(X1)
| cC5(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
( ~ cTEST(X1)
| cC4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
cTEST(i2003_11_14_17_19_57994),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_28,plain,
~ cTEST(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS090+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:53:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3684630 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.44 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 3684639 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 9
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 48
% 0.11/0.45 % Removed in clause preprocessing : 1
% 0.11/0.45 % Initial clauses in saturation : 47
% 0.11/0.45 % Processed clauses : 53
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 53
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 7
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 9
% 0.11/0.45 % ...of the previous two non-redundant : 7
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 4
% 0.11/0.45 % Paramodulations : 8
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 0
% 0.11/0.45 % ...of those cached : 0
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 45
% 0.11/0.45 % Positive orientable unit clauses : 1
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 2
% 0.11/0.45 % Non-unit-clauses : 42
% 0.11/0.45 % Current number of unprocessed clauses: 1
% 0.11/0.45 % ...number of literals in the above : 3
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 9
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 404
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 393
% 0.11/0.45 % Non-unit clause-clause subsumptions : 7
% 0.11/0.45 % Unit Clause-clause subsumption calls : 46
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 2552
% 0.11/0.45 % Search garbage collected termcells : 221
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.004 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.008 s
% 0.11/0.45 % Maximum resident set size: 3612 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.013 s
% 0.11/0.45 % System time : 0.012 s
% 0.11/0.45 % Total time : 0.025 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------