%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS079+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 : 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:00:42 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 115 ( 13 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 132 ( 58 ~; 49 |; 16 &)
% ( 1 <=>; 8 =>; 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 : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn 32 !; 3 ?)
% 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)
=> ! [X6,X7] :
( ( rf1(X4,X7)
& rf1(X4,X6) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cowlThing(X5)
& rr(X4,X5) )
& ? [X5] :
( cp1(X5)
& rf1(X4,X5) )
& ? [X5] :
( cp2(X5)
& rf2(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X6,X7] :
( ( rf2(X4,X7)
& rf2(X4,X6) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ cp2(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_6,axiom,
cUnsatisfiable(i2003_11_14_17_19_17492),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(c_0_8,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_9,plain,
! [X51,X52,X53] :
( X52 = X53
| ~ rf1(X51,X53)
| ~ rf1(X51,X52)
| ~ cowlThing(X51) ),
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,
! [X40] :
( ~ cowlNothing(X40)
& cowlThing(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_11,plain,
! [X57,X58] :
( rf1(X57,X58)
| ~ rr(X57,X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_12,plain,
! [X42,X46,X47,X48,X49] :
( ( cUnsatisfiable(X46)
| ~ cowlThing(X49)
| ~ rr(X46,X49)
| ~ cp1(X48)
| ~ rf1(X46,X48)
| ~ cp2(X47)
| ~ rf2(X46,X47) )
& ( ~ cUnsatisfiable(X42)
| cowlThing(esk3_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| rr(X42,esk3_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| cp1(esk2_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| rf1(X42,esk2_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| cp2(esk1_1(X42)) )
& ( ~ cUnsatisfiable(X42)
| rf2(X42,esk1_1(X42)) ) ),
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])])])])])])]) ).
fof(c_0_13,plain,
! [X54,X55,X56] :
( X55 = X56
| ~ rf2(X54,X56)
| ~ rf2(X54,X55)
| ~ cowlThing(X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
cnf(c_0_14,plain,
( ~ rf1(X1,X3)
| ~ rf1(X1,X2)
| ~ cowlThing(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ rr(X1,X2)
| rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ rf2(X1,X3)
| ~ rf2(X1,X2)
| ~ cowlThing(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X59,X60] :
( rf2(X59,X60)
| ~ rr(X59,X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
fof(c_0_20,plain,
! [X4] :
( cp1(X4)
=> ~ cp2(X4) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_21,plain,
( ~ rf1(X1,X2)
| ~ rf1(X1,X3)
| X2 = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ rf2(X1,X2)
| ~ rf2(X1,X3)
| X2 = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15])]) ).
cnf(c_0_24,plain,
( ~ cUnsatisfiable(X1)
| rf2(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( ~ rr(X1,X2)
| rf2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X50] :
( ~ cp2(X50)
| ~ cp1(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X2)
| ~ rf1(X2,X1)
| X1 = esk3_1(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X2)
| ~ rf2(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X1)
| rf2(X1,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_31,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| cp2(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk1_1(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ cUnsatisfiable(X1)
| cp1(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,plain,
cUnsatisfiable(i2003_11_14_17_19_17492),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_39,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS079+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.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:47:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 803048 completed with status 0
% 0.10/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.10/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 803061 completed with status 0
% 0.10/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43 % Presaturation interreduction done
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Unsatisfiable
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 22
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 30
% 0.10/0.43 % Removed in clause preprocessing : 15
% 0.10/0.43 % Initial clauses in saturation : 15
% 0.10/0.43 % Processed clauses : 42
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 1
% 0.10/0.43 % ...remaining for further processing : 41
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 15
% 0.10/0.43 % Backward-rewritten : 0
% 0.10/0.43 % Generated clauses : 26
% 0.10/0.43 % ...of the previous two non-redundant : 22
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 1
% 0.10/0.43 % Paramodulations : 25
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 0
% 0.10/0.43 % ...of those cached : 0
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 10
% 0.10/0.43 % Positive orientable unit clauses : 0
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 2
% 0.10/0.43 % Non-unit-clauses : 8
% 0.10/0.43 % Current number of unprocessed clauses: 10
% 0.10/0.43 % ...number of literals in the above : 21
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 32
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 115
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 80
% 0.10/0.43 % Non-unit clause-clause subsumptions : 2
% 0.10/0.43 % Unit Clause-clause subsumption calls : 15
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 0
% 0.10/0.43 % BW rewrite match successes : 0
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 2383
% 0.10/0.43 % Search garbage collected termcells : 480
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.006 s
% 0.10/0.43 % System time : 0.002 s
% 0.10/0.43 % Total time : 0.009 s
% 0.10/0.43 % Maximum resident set size: 3656 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.012 s
% 0.10/0.43 % System time : 0.014 s
% 0.10/0.43 % Total time : 0.026 s
% 0.10/0.43 % Maximum resident set size: 4608 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------