%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS073+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 : n014.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.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 119 ( 6 equ)
% Maximal formula atoms : 35 ( 3 avg)
% Number of connectives : 144 ( 56 ~; 59 |; 19 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 64 ( 1 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ~ cp(X4)
& ? [X5] :
( ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( cp(X7)
& rs(X6,X7) ) )
& ! [X6] :
( rinvS(X5,X6)
=> cp(X6) )
& rf(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_11,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
! [X4,X5,X6] :
( ( rf(X4,X6)
& rf(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rinvS(X4,X5)
<=> rs(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_9,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(c_0_6,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ~ cp(X4)
& ? [X5] :
( ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( cp(X7)
& rs(X6,X7) ) )
& ! [X6] :
( rinvS(X5,X6)
=> cp(X6) )
& rf(X4,X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
! [X85,X86] :
( rf(X85,X86)
| ~ rs(X85,X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_11])])]) ).
fof(c_0_8,plain,
! [X58,X60,X61,X63,X64,X67] :
( ( cUnsatisfiable(X63)
| cp(X63)
| ~ rf(X63,X64)
| ~ cp(esk3_2(X63,X64))
| ~ cp(X67)
| ~ rs(esk4_2(X63,X64),X67) )
& ( cUnsatisfiable(X63)
| cp(X63)
| ~ rf(X63,X64)
| ~ cp(esk3_2(X63,X64))
| rinvF(X64,esk4_2(X63,X64)) )
& ( cUnsatisfiable(X63)
| cp(X63)
| ~ rf(X63,X64)
| rinvS(X64,esk3_2(X63,X64))
| ~ cp(X67)
| ~ rs(esk4_2(X63,X64),X67) )
& ( cUnsatisfiable(X63)
| cp(X63)
| ~ rf(X63,X64)
| rinvS(X64,esk3_2(X63,X64))
| rinvF(X64,esk4_2(X63,X64)) )
& ( ~ cUnsatisfiable(X58)
| ~ cp(X58) )
& ( ~ cUnsatisfiable(X58)
| ~ rinvF(esk1_1(X58),X61)
| cp(esk2_2(X58,X61)) )
& ( ~ cUnsatisfiable(X58)
| ~ rinvF(esk1_1(X58),X61)
| rs(X61,esk2_2(X58,X61)) )
& ( ~ cUnsatisfiable(X58)
| cp(X60)
| ~ rinvS(esk1_1(X58),X60) )
& ( ~ cUnsatisfiable(X58)
| rf(X58,esk1_1(X58)) ) ),
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_6])])])])])])]) ).
cnf(c_0_9,plain,
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ cUnsatisfiable(X2)
| ~ rinvF(esk1_1(X2),X1)
| rs(X1,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X74,X75] :
( ( rinvF(X74,X75)
| ~ rf(X75,X74) )
& ( rf(X75,X74)
| ~ rinvF(X74,X75) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_12,plain,
! [X68,X69,X70] :
( X69 = X70
| ~ rf(X68,X70)
| ~ rf(X68,X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X2)
| ~ rinvF(esk1_1(X2),X1)
| rf(X1,esk2_2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ rf(X1,X2)
| rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X1,esk1_1(X2))
| rf(X1,esk2_2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X3,X1)
| ~ rf(X3,esk1_1(X2))
| X1 = esk2_2(X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| rf(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X2,X1)
| X1 = esk2_2(X2,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_20,plain,
! [X78,X79] :
( ( rinvS(X78,X79)
| ~ rs(X79,X78) )
& ( rs(X79,X78)
| ~ rinvS(X78,X79) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X1)
| esk2_2(X1,X1) = esk1_1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvS(esk1_1(X1),X2)
| cp(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( ~ rs(X1,X2)
| rinvS(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvF(esk1_1(X1),X1)
| rs(X1,esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_25,plain,
( ~ cUnsatisfiable(X2)
| ~ rs(X1,esk1_1(X2))
| cp(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| rs(X1,esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_18]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(split_conjunct,[status(thm)],[axiom_9]) ).
cnf(c_0_29,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS073+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.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 22:52:51 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 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.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2537501 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % SubtermCWHack with pid 2537515 completed with status 0
% 0.14/0.42 % Result found by SubtermCWHack
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Unsatisfiable
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 30
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 43
% 0.14/0.42 % Removed in clause preprocessing : 19
% 0.14/0.42 % Initial clauses in saturation : 24
% 0.14/0.42 % Processed clauses : 38
% 0.14/0.42 % ...of these trivial : 0
% 0.14/0.42 % ...subsumed : 0
% 0.14/0.42 % ...remaining for further processing : 38
% 0.14/0.42 % Other redundant clauses eliminated : 0
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 19
% 0.14/0.42 % Backward-rewritten : 0
% 0.14/0.42 % Generated clauses : 32
% 0.14/0.42 % ...of the previous two non-redundant : 26
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 2
% 0.14/0.42 % Paramodulations : 31
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 0
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 0
% 0.14/0.42 % ...of those cached : 0
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 18
% 0.14/0.42 % Positive orientable unit clauses : 0
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 3
% 0.14/0.42 % Non-unit-clauses : 15
% 0.14/0.42 % Current number of unprocessed clauses: 12
% 0.14/0.42 % ...number of literals in the above : 52
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 21
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 317
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 265
% 0.14/0.42 % Non-unit clause-clause subsumptions : 3
% 0.14/0.42 % Unit Clause-clause subsumption calls : 19
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 0
% 0.14/0.42 % BW rewrite match successes : 0
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 3353
% 0.14/0.42 % Search garbage collected termcells : 713
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.007 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.010 s
% 0.14/0.42 % Maximum resident set size: 3664 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.022 s
% 0.14/0.42 % System time : 0.011 s
% 0.14/0.42 % Total time : 0.033 s
% 0.14/0.42 % Maximum resident set size: 4864 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------