%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS089+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:44 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 91 ( 33 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 99 ( 38 ~; 33 |; 23 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 45 ( 4 sgn 18 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cowlThing(X4)
=> ? [X8] :
( X8 = ispy
& rp(X4,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4,X8] :
( rp(X4,X8)
<=> rinvP(X8,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
=> ? [X5,X6,X7] :
( X6 != X7
& X5 != X7
& X5 != X6
& rr(X4,X7)
& rr(X4,X6)
& rr(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X9,X10,X11] :
( ( rinvP(ispy,X11)
& rinvP(ispy,X10)
& rinvP(ispy,X9) )
=> ( X10 = X11
| X9 = X11
| X9 = X10 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_6,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,plain,
! [X46] :
( ( ~ cowlThing(X46)
| esk4_1(X46) = ispy )
& ( ~ cowlThing(X46)
| rp(X46,esk4_1(X46)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).
fof(c_0_8,plain,
! [X40] :
( ~ cowlNothing(X40)
& cowlThing(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,plain,
( ~ cowlThing(X1)
| esk4_1(X1) = ispy ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X48,X49] :
( ( rp(X48,X49)
| ~ rinvP(X49,X48) )
& ( rinvP(X49,X48)
| ~ rp(X48,X49) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
cnf(c_0_12,plain,
( ~ cowlThing(X1)
| rp(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
esk4_1(X1) = ispy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
fof(c_0_14,plain,
! [X4] :
( cUnsatisfiable(X4)
=> ? [X5,X6,X7] :
( X6 != X7
& X5 != X7
& X5 != X6
& rr(X4,X7)
& rr(X4,X6)
& rr(X4,X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_15,plain,
! [X50,X51,X52] :
( X51 = X52
| X50 = X52
| X50 = X51
| ~ rinvP(ispy,X52)
| ~ rinvP(ispy,X51)
| ~ rinvP(ispy,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_16,plain,
( ~ rp(X1,X2)
| rinvP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
rp(X1,ispy),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10])]),c_0_13]) ).
fof(c_0_18,plain,
! [X42] :
( ( ~ cUnsatisfiable(X42)
| esk2_1(X42) != esk3_1(X42) )
& ( ~ cUnsatisfiable(X42)
| esk1_1(X42) != esk3_1(X42) )
& ( ~ cUnsatisfiable(X42)
| esk1_1(X42) != esk2_1(X42) )
& ( ~ cUnsatisfiable(X42)
| rr(X42,esk3_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| rr(X42,esk2_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| rr(X42,esk1_1(X42)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
cnf(c_0_19,plain,
( ~ rinvP(ispy,X3)
| ~ rinvP(ispy,X2)
| ~ rinvP(ispy,X1)
| X2 = X3
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
rinvP(ispy,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( X3 = X1
| X3 = X2
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20])]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = X2
| esk1_1(X1) = X2 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,plain,
cUnsatisfiable(i2003_11_14_17_19_53168),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_25,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( esk1_1(i2003_11_14_17_19_53168) = X1
| esk3_1(i2003_11_14_17_19_53168) = X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
esk2_1(i2003_11_14_17_19_53168) = esk1_1(i2003_11_14_17_19_53168),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])])]) ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS089+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.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:27 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.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 370264 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: FGHSF-FFSF11-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--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 370278 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: FGHSF-FFSF11-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 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 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.44 % Parsed axioms : 19
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 28
% 0.11/0.44 % Removed in clause preprocessing : 14
% 0.11/0.44 % Initial clauses in saturation : 14
% 0.11/0.44 % Processed clauses : 35
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 1
% 0.11/0.44 % ...remaining for further processing : 34
% 0.11/0.44 % Other redundant clauses eliminated : 19
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 130
% 0.11/0.44 % ...of the previous two non-redundant : 75
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 85
% 0.11/0.44 % Factorizations : 26
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 19
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 7
% 0.11/0.44 % ...of those cached : 3
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 20
% 0.11/0.44 % Positive orientable unit clauses : 4
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 1
% 0.11/0.44 % Non-unit-clauses : 15
% 0.11/0.44 % Current number of unprocessed clauses: 68
% 0.11/0.44 % ...number of literals in the above : 224
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 16
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 43
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 33
% 0.11/0.44 % Non-unit clause-clause subsumptions : 1
% 0.11/0.44 % Unit Clause-clause subsumption calls : 3
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 2133
% 0.11/0.44 % Search garbage collected termcells : 361
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.005 s
% 0.11/0.44 % System time : 0.004 s
% 0.11/0.44 % Total time : 0.009 s
% 0.11/0.44 % Maximum resident set size: 3396 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.015 s
% 0.11/0.44 % System time : 0.012 s
% 0.11/0.44 % Total time : 0.027 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------