%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS111+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 : n011.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:00:47 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 4 unt; 0 def)
% Number of atoms : 108 ( 12 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 123 ( 53 ~; 48 |; 15 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 71 ( 2 sgn 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5,axiom,
! [X4,X5,X7] :
( ( rf(X4,X7)
& rf(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cp(X5)
& rf(X4,X5) )
& ? [X5] :
( cowlThing(X5)
& rs(X4,X5) )
& ? [X5] :
( cpxcomp(X5)
& rf1(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_12,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_6,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X7)
& rf1(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_13,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X82,X83,X84] :
( X83 = X84
| ~ rf(X82,X84)
| ~ rf(X82,X83) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_9,plain,
! [X66,X70,X71,X72,X73] :
( ( cUnsatisfiable(X70)
| ~ cp(X73)
| ~ rf(X70,X73)
| ~ cowlThing(X72)
| ~ rs(X70,X72)
| ~ cpxcomp(X71)
| ~ rf1(X70,X71) )
& ( ~ cUnsatisfiable(X66)
| cp(esk3_1(X66)) )
& ( ~ cUnsatisfiable(X66)
| rf(X66,esk3_1(X66)) )
& ( ~ cUnsatisfiable(X66)
| cowlThing(esk2_1(X66)) )
& ( ~ cUnsatisfiable(X66)
| rs(X66,esk2_1(X66)) )
& ( ~ cUnsatisfiable(X66)
| cpxcomp(esk1_1(X66)) )
& ( ~ cUnsatisfiable(X66)
| rf1(X66,esk1_1(X66)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])]) ).
cnf(c_0_10,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ cUnsatisfiable(X1)
| rf(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X97,X98] :
( rf(X97,X98)
| ~ rs(X97,X98) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])])]) ).
fof(c_0_13,plain,
! [X85,X86,X87] :
( X86 = X87
| ~ rf1(X85,X87)
| ~ rf1(X85,X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
cnf(c_0_14,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X2,X1)
| X1 = esk3_1(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X74,X75,X76] :
( ( cp(X76)
| ra_Px1(X76,esk4_1(X76)) )
& ( ~ ra_Px1(X74,X75)
| ~ cp(X74) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])])]) ).
fof(c_0_17,plain,
! [X78,X80,X81] :
( ( cpxcomp(X80)
| ~ ra_Px1(X80,X81) )
& ( ra_Px1(X78,esk5_1(X78))
| ~ cpxcomp(X78) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])])]) ).
cnf(c_0_18,plain,
( ~ rf1(X1,X3)
| ~ rf1(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X99,X100] :
( rf1(X99,X100)
| ~ rs(X99,X100) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_13])])]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X2)
| ~ rs(X2,X1)
| X1 = esk3_1(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X1)
| rs(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ ra_Px1(X1,X2)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ cpxcomp(X1)
| ra_Px1(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ cUnsatisfiable(X2)
| ~ rf1(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ rs(X1,X2)
| rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = esk3_1(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X1)
| cpxcomp(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X2)
| ~ rs(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| rs(X1,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) = esk3_1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X1)
| cp(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_36,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS111+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n011.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 20 22:53:56 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 371948 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 371963 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 35
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 48
% 0.14/0.43 % Removed in clause preprocessing : 23
% 0.14/0.43 % Initial clauses in saturation : 25
% 0.14/0.43 % Processed clauses : 43
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 2
% 0.14/0.43 % ...remaining for further processing : 41
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 16
% 0.14/0.43 % Backward-rewritten : 0
% 0.14/0.43 % Generated clauses : 36
% 0.14/0.43 % ...of the previous two non-redundant : 26
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 1
% 0.14/0.43 % Paramodulations : 35
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 0
% 0.14/0.43 % ...of those cached : 0
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 24
% 0.14/0.43 % Positive orientable unit clauses : 0
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 2
% 0.14/0.43 % Non-unit-clauses : 22
% 0.14/0.43 % Current number of unprocessed clauses: 8
% 0.14/0.43 % ...number of literals in the above : 21
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 18
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 123
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 78
% 0.14/0.43 % Non-unit clause-clause subsumptions : 3
% 0.14/0.43 % Unit Clause-clause subsumption calls : 16
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 0
% 0.14/0.43 % BW rewrite match successes : 0
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 3559
% 0.14/0.43 % Search garbage collected termcells : 766
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.007 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.010 s
% 0.14/0.43 % Maximum resident set size: 3672 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.015 s
% 0.14/0.43 % System time : 0.011 s
% 0.14/0.43 % Total time : 0.027 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------