%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS083+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 : n004.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:28 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 141 ( 6 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 171 ( 72 ~; 61 |; 27 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 2 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_4,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X7,X8] :
( ( rf(X4,X8)
& rf(X4,X7) )
=> X7 = X8 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cd(X4)
<=> ( cc(X4)
& ? [X5] :
( ~ cc(X5)
& rf(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cd(X5)
& rinvF(X4,X5) )
& ~ cc(X4)
& ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( cd(X6)
& rinvF(X5,X6) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rf(X4,X5)
=> rr(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_19_32337),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_8,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_9,plain,
! [X61,X62,X63] :
( X62 = X63
| ~ rf(X61,X63)
| ~ rf(X61,X62)
| ~ cowlThing(X61) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
fof(c_0_10,plain,
! [X47] :
( ~ cowlNothing(X47)
& cowlThing(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_11,plain,
! [X4] :
( cd(X4)
<=> ( cc(X4)
& ? [X5] :
( ~ cc(X5)
& rf(X4,X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_12,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cd(X5)
& rinvF(X4,X5) )
& ~ cc(X4)
& ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( cd(X6)
& rinvF(X5,X6) ) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_13,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| ~ cowlThing(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X57,X59,X60] :
( ( cd(X59)
| ~ cc(X59)
| cc(X60)
| ~ rf(X59,X60) )
& ( ~ cd(X57)
| cc(X57) )
& ( ~ cd(X57)
| ~ cc(esk4_1(X57)) )
& ( ~ cd(X57)
| rf(X57,esk4_1(X57)) ) ),
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)],[c_0_11])])])])])])]) ).
fof(c_0_16,plain,
! [X64,X65] :
( ( rinvF(X64,X65)
| ~ rf(X65,X64) )
& ( rf(X65,X64)
| ~ rinvF(X64,X65) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_17,plain,
! [X49,X50,X53,X55,X56] :
( ( cUnsatisfiable(X53)
| ~ cd(X56)
| ~ rinvF(X53,X56)
| cc(X53)
| ~ cd(X55)
| ~ rinvF(esk3_1(X53),X55) )
& ( cUnsatisfiable(X53)
| ~ cd(X56)
| ~ rinvF(X53,X56)
| cc(X53)
| rinvR(X53,esk3_1(X53)) )
& ( ~ cUnsatisfiable(X49)
| cd(esk2_1(X49)) )
& ( ~ cUnsatisfiable(X49)
| rinvF(X49,esk2_1(X49)) )
& ( ~ cUnsatisfiable(X49)
| ~ cc(X49) )
& ( ~ cUnsatisfiable(X49)
| ~ rinvR(X49,X50)
| cd(esk1_2(X49,X50)) )
& ( ~ cUnsatisfiable(X49)
| ~ rinvR(X49,X50)
| rinvF(X50,esk1_2(X49,X50)) ) ),
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)],[c_0_12])])])])])])]) ).
cnf(c_0_18,plain,
( ~ rf(X1,X2)
| ~ rf(X1,X3)
| X2 = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
( ~ cd(X1)
| rf(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ rinvF(X1,X2)
| rf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X2)
| ~ rinvR(X2,X1)
| rinvF(X1,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ cd(X2)
| ~ rf(X2,X1)
| X1 = esk4_1(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| rf(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| cd(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ cd(X1)
| ~ cc(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| esk4_1(esk1_2(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
fof(c_0_27,plain,
! [X66,X67] :
( ( rinvR(X66,X67)
| ~ rr(X67,X66) )
& ( rr(X67,X66)
| ~ rinvR(X66,X67) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| ~ cc(X2)
| ~ rinvR(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,plain,
( ~ rr(X1,X2)
| rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X71,X72] :
( rr(X71,X72)
| ~ rf(X71,X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])])]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ rf(X1,X2)
| rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| rinvF(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X2)
| ~ cc(X1)
| ~ rf(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( ~ cUnsatisfiable(X1)
| rf(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_36,plain,
( ~ cUnsatisfiable(X1)
| ~ cc(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( ~ cd(X1)
| cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,plain,
( ~ cUnsatisfiable(X1)
| cd(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_39,plain,
cUnsatisfiable(i2003_11_14_17_19_32337),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_40,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS083+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/10.38 % Computer : n004.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Sun Sep 20 22:53:19 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.11/10.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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.15/10.45 % Version: 3.5.1
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.45 % Starting sh5l with 300s (1) cores
% 0.15/10.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1668548 completed with status 0
% 0.15/10.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.45 % No SInE strategy applied
% 0.15/10.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/10.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/10.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/10.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/10.45 % SubtermCWHack with pid 1668561 completed with status 0
% 0.15/10.45 % Result found by SubtermCWHack
% 0.15/10.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.45 % No SInE strategy applied
% 0.15/10.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/10.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.45 % Preprocessing time : 0.001 s
% 0.15/10.45
% 0.15/10.45 % Proof found!
% 0.15/10.45 % SZS status Unsatisfiable
% 0.15/10.45 % SZS output start CNFRefutation
% See solution above
% 0.15/10.45 % Parsed axioms : 25
% 0.15/10.45 % Removed by relevancy pruning/SinE : 0
% 0.15/10.45 % Initial clauses : 38
% 0.15/10.45 % Removed in clause preprocessing : 16
% 0.15/10.45 % Initial clauses in saturation : 22
% 0.15/10.45 % Processed clauses : 74
% 0.15/10.45 % ...of these trivial : 0
% 0.15/10.45 % ...subsumed : 8
% 0.15/10.45 % ...remaining for further processing : 66
% 0.15/10.45 % Other redundant clauses eliminated : 0
% 0.15/10.45 % Clauses deleted for lack of memory : 0
% 0.15/10.45 % Backward-subsumed : 33
% 0.15/10.45 % Backward-rewritten : 0
% 0.15/10.45 % Generated clauses : 148
% 0.15/10.45 % ...of the previous two non-redundant : 127
% 0.15/10.45 % ...aggressively subsumed : 0
% 0.15/10.45 % Contextual simplify-reflections : 7
% 0.15/10.45 % Paramodulations : 147
% 0.15/10.45 % Factorizations : 0
% 0.15/10.45 % NegExts : 0
% 0.15/10.45 % Equation resolutions : 0
% 0.15/10.45 % Disequality decompositions : 0
% 0.15/10.45 % Total rewrite steps : 0
% 0.15/10.45 % ...of those cached : 0
% 0.15/10.45 % Propositional unsat checks : 0
% 0.15/10.45 % Propositional check models : 0
% 0.15/10.45 % Propositional check unsatisfiable : 0
% 0.15/10.45 % Propositional clauses : 0
% 0.15/10.45 % Propositional clauses after purity: 0
% 0.15/10.45 % Propositional unsat core size : 0
% 0.15/10.45 % Propositional preprocessing time : 0.000
% 0.15/10.45 % Propositional encoding time : 0.000
% 0.15/10.45 % Propositional solver time : 0.000
% 0.15/10.45 % Success case prop preproc time : 0.000
% 0.15/10.45 % Success case prop encoding time : 0.000
% 0.15/10.45 % Success case prop solver time : 0.000
% 0.15/10.45 % Current number of processed clauses : 32
% 0.15/10.45 % Positive orientable unit clauses : 0
% 0.15/10.45 % Positive unorientable unit clauses: 0
% 0.15/10.45 % Negative unit clauses : 3
% 0.15/10.45 % Non-unit-clauses : 29
% 0.15/10.45 % Current number of unprocessed clauses: 75
% 0.15/10.45 % ...number of literals in the above : 396
% 0.15/10.45 % Current number of archived formulas : 0
% 0.15/10.45 % Current number of archived clauses : 35
% 0.15/10.45 % Clause-clause subsumption calls (NU) : 861
% 0.15/10.45 % Rec. Clause-clause subsumption calls : 480
% 0.15/10.45 % Non-unit clause-clause subsumptions : 15
% 0.15/10.45 % Unit Clause-clause subsumption calls : 35
% 0.15/10.45 % Rewrite failures with RHS unbound : 0
% 0.15/10.45 % BW rewrite match attempts : 0
% 0.15/10.45 % BW rewrite match successes : 0
% 0.15/10.45 % Condensation attempts : 0
% 0.15/10.45 % Condensation successes : 0
% 0.15/10.45 % Termbank termtop insertions : 5127
% 0.15/10.45 % Search garbage collected termcells : 632
% 0.15/10.45
% 0.15/10.45 % -------------------------------------------------
% 0.15/10.45 % User time : 0.008 s
% 0.15/10.45 % System time : 0.004 s
% 0.15/10.45 % Total time : 0.013 s
% 0.15/10.45 % Maximum resident set size: 3660 pages
% 0.15/10.45
% 0.15/10.45 % -------------------------------------------------
% 0.15/10.45 % User time : 0.028 s
% 0.15/10.45 % System time : 0.013 s
% 0.15/10.45 % Total time : 0.041 s
% 0.15/10.45 % Maximum resident set size: 4864 pages
% 0.15/10.45 % E exiting
%------------------------------------------------------------------------------