%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS085+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 : n018.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:43 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 92 ( 37 ~; 33 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 39 ( 1 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( ? [X6] :
( ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6)
& rr(X5,X6) )
& rr(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X5,X6] :
( ( rr(X5,X6)
& rr(X4,X5) )
=> rr(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( ? [X6] :
( ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6)
& rr(X5,X6) )
& rr(X4,X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X63,X64,X65] :
( rr(X63,X65)
| ~ rr(X64,X65)
| ~ rr(X63,X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
fof(c_0_6,plain,
! [X48,X51,X52,X53,X54] :
( ( cUnsatisfiable(X52)
| ~ cp1(X52)
| ~ rr(X52,X53)
| ~ cp1(X54)
| ~ rr(X53,X54)
| cp1(esk3_3(X52,X53,X54)) )
& ( cUnsatisfiable(X52)
| ~ cp1(X52)
| ~ rr(X52,X53)
| ~ cp1(X54)
| ~ rr(X53,X54)
| rinvR(X54,esk3_3(X52,X53,X54)) )
& ( ~ cUnsatisfiable(X48)
| cp1(X48) )
& ( ~ cUnsatisfiable(X48)
| ~ cp1(X51)
| ~ rinvR(esk2_1(X48),X51) )
& ( ~ cUnsatisfiable(X48)
| cp1(esk2_1(X48)) )
& ( ~ cUnsatisfiable(X48)
| rr(esk1_1(X48),esk2_1(X48)) )
& ( ~ cUnsatisfiable(X48)
| rr(X48,esk1_1(X48)) ) ),
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_4])])])])])])]) ).
fof(c_0_7,plain,
! [X61,X62] :
( ( rinvR(X61,X62)
| ~ rr(X62,X61) )
& ( rr(X62,X61)
| ~ rinvR(X61,X62) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_8,plain,
( ~ rr(X2,X3)
| ~ rr(X1,X2)
| rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ cUnsatisfiable(X1)
| rr(esk1_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(X2)
| ~ rinvR(esk2_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ rr(X1,X2)
| rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ cUnsatisfiable(X2)
| ~ rr(X1,esk1_1(X2))
| rr(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ cUnsatisfiable(X2)
| ~ cp1(X1)
| ~ rr(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_18,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS085+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n018.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Sun Sep 20 22:55:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.44 % Version: 3.5.1
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 375554 completed with status 0
% 0.15/5.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.44 % No SInE strategy applied
% 0.15/5.44 % Search class: FGHSF-FFSF31-SFFFFFNN
% 0.15/5.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 136s (1) cores
% 0.15/5.44 % SubtermCWHack with pid 375561 completed with status 0
% 0.15/5.44 % Result found by SubtermCWHack
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.44 % No SInE strategy applied
% 0.15/5.44 % Search class: FGHSF-FFSF31-SFFFFFNN
% 0.15/5.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.44 % Preprocessing time : 0.002 s
% 0.15/5.44
% 0.15/5.44 % Proof found!
% 0.15/5.44 % SZS status Unsatisfiable
% 0.15/5.44 % SZS output start CNFRefutation
% See solution above
% 0.15/5.44 % Parsed axioms : 22
% 0.15/5.44 % Removed by relevancy pruning/SinE : 0
% 0.15/5.44 % Initial clauses : 32
% 0.15/5.44 % Removed in clause preprocessing : 15
% 0.15/5.44 % Initial clauses in saturation : 17
% 0.15/5.44 % Processed clauses : 23
% 0.15/5.44 % ...of these trivial : 0
% 0.15/5.44 % ...subsumed : 0
% 0.15/5.44 % ...remaining for further processing : 23
% 0.15/5.44 % Other redundant clauses eliminated : 0
% 0.15/5.44 % Clauses deleted for lack of memory : 0
% 0.15/5.44 % Backward-subsumed : 11
% 0.15/5.44 % Backward-rewritten : 0
% 0.15/5.44 % Generated clauses : 14
% 0.15/5.44 % ...of the previous two non-redundant : 10
% 0.15/5.44 % ...aggressively subsumed : 0
% 0.15/5.44 % Contextual simplify-reflections : 1
% 0.15/5.44 % Paramodulations : 13
% 0.15/5.44 % Factorizations : 0
% 0.15/5.44 % NegExts : 0
% 0.15/5.44 % Equation resolutions : 0
% 0.15/5.44 % Disequality decompositions : 0
% 0.15/5.44 % Total rewrite steps : 0
% 0.15/5.44 % ...of those cached : 0
% 0.15/5.44 % Propositional unsat checks : 0
% 0.15/5.44 % Propositional check models : 0
% 0.15/5.44 % Propositional check unsatisfiable : 0
% 0.15/5.44 % Propositional clauses : 0
% 0.15/5.44 % Propositional clauses after purity: 0
% 0.15/5.44 % Propositional unsat core size : 0
% 0.15/5.44 % Propositional preprocessing time : 0.000
% 0.15/5.44 % Propositional encoding time : 0.000
% 0.15/5.44 % Propositional solver time : 0.000
% 0.15/5.44 % Success case prop preproc time : 0.000
% 0.15/5.44 % Success case prop encoding time : 0.000
% 0.15/5.44 % Success case prop solver time : 0.000
% 0.15/5.44 % Current number of processed clauses : 11
% 0.15/5.44 % Positive orientable unit clauses : 0
% 0.15/5.44 % Positive unorientable unit clauses: 0
% 0.15/5.44 % Negative unit clauses : 2
% 0.15/5.44 % Non-unit-clauses : 9
% 0.15/5.44 % Current number of unprocessed clauses: 4
% 0.15/5.44 % ...number of literals in the above : 16
% 0.15/5.44 % Current number of archived formulas : 0
% 0.15/5.44 % Current number of archived clauses : 13
% 0.15/5.44 % Clause-clause subsumption calls (NU) : 75
% 0.15/5.44 % Rec. Clause-clause subsumption calls : 52
% 0.15/5.44 % Non-unit clause-clause subsumptions : 1
% 0.15/5.44 % Unit Clause-clause subsumption calls : 11
% 0.15/5.44 % Rewrite failures with RHS unbound : 0
% 0.15/5.44 % BW rewrite match attempts : 0
% 0.15/5.44 % BW rewrite match successes : 0
% 0.15/5.44 % Condensation attempts : 0
% 0.15/5.44 % Condensation successes : 0
% 0.15/5.44 % Termbank termtop insertions : 2348
% 0.15/5.44 % Search garbage collected termcells : 538
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.005 s
% 0.15/5.44 % System time : 0.003 s
% 0.15/5.44 % Total time : 0.008 s
% 0.15/5.44 % Maximum resident set size: 3656 pages
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.015 s
% 0.15/5.44 % System time : 0.015 s
% 0.15/5.44 % Total time : 0.029 s
% 0.15/5.44 % Maximum resident set size: 4864 pages
% 0.15/5.44 % E exiting
%------------------------------------------------------------------------------