%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS072+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:41 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 88 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 116 ( 50 ~; 46 |; 16 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp2(X4)
& ? [X5] :
( ? [X8] :
( cp1(X8)
& rr(X5,X8) )
& ! [X6,X7] :
( ( rr(X5,X7)
& rr(X5,X6) )
=> X6 = X7 )
& rinvR(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp5(X4)
| cp4(X4)
| cp2(X4)
| cp3(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_4,plain,
! [X57,X58] :
( ( rinvR(X57,X58)
| ~ rr(X58,X57) )
& ( rr(X58,X57)
| ~ rinvR(X57,X58) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_5,plain,
! [X43,X45,X46,X48,X49,X52] :
( ( cUnsatisfiable(X48)
| ~ cp2(X48)
| ~ cp1(X52)
| ~ rr(X49,X52)
| ~ rinvR(X48,X49)
| esk3_2(X48,X49) != esk4_2(X48,X49) )
& ( cUnsatisfiable(X48)
| ~ cp2(X48)
| ~ cp1(X52)
| ~ rr(X49,X52)
| ~ rinvR(X48,X49)
| rr(X49,esk4_2(X48,X49)) )
& ( cUnsatisfiable(X48)
| ~ cp2(X48)
| ~ cp1(X52)
| ~ rr(X49,X52)
| ~ rinvR(X48,X49)
| rr(X49,esk3_2(X48,X49)) )
& ( ~ cUnsatisfiable(X43)
| cp2(X43) )
& ( ~ cUnsatisfiable(X43)
| cp1(esk2_1(X43)) )
& ( ~ cUnsatisfiable(X43)
| rr(esk1_1(X43),esk2_1(X43)) )
& ( ~ cUnsatisfiable(X43)
| X45 = X46
| ~ rr(esk1_1(X43),X46)
| ~ rr(esk1_1(X43),X45) )
& ( ~ cUnsatisfiable(X43)
| rinvR(X43,esk1_1(X43)) ) ),
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_6,plain,
! [X53] :
( ( ~ cp1(X53)
| ~ cp5(X53) )
& ( ~ cp1(X53)
| ~ cp4(X53) )
& ( ~ cp1(X53)
| ~ cp2(X53) )
& ( ~ cp1(X53)
| ~ cp3(X53) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_7,plain,
( ~ rinvR(X1,X2)
| rr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ cUnsatisfiable(X1)
| rinvR(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ cUnsatisfiable(X1)
| cp1(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(esk1_1(X1),X3)
| ~ rr(esk1_1(X1),X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ cUnsatisfiable(X1)
| rr(esk1_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X1)
| ~ cp2(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ cUnsatisfiable(X1)
| cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ cUnsatisfiable(X2)
| ~ rr(esk1_1(X2),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| rr(esk1_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS072+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.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % 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:52:56 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.40 Running first-order theorem proving
% 0.11/0.40 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.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 368641 completed with status 0
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 368655 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Preprocessing time : 0.002 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Unsatisfiable
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 23
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 39
% 0.11/0.43 % Removed in clause preprocessing : 15
% 0.11/0.43 % Initial clauses in saturation : 24
% 0.11/0.43 % Processed clauses : 27
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 27
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 10
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 13
% 0.11/0.43 % ...of the previous two non-redundant : 10
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 12
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 0
% 0.11/0.43 % ...of those cached : 0
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 16
% 0.11/0.43 % Positive orientable unit clauses : 0
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 2
% 0.11/0.43 % Non-unit-clauses : 14
% 0.11/0.43 % Current number of unprocessed clauses: 7
% 0.11/0.43 % ...number of literals in the above : 27
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 12
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 61
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 58
% 0.11/0.43 % Non-unit clause-clause subsumptions : 0
% 0.11/0.43 % Unit Clause-clause subsumption calls : 10
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 2504
% 0.11/0.43 % Search garbage collected termcells : 587
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.008 s
% 0.11/0.43 % System time : 0.003 s
% 0.11/0.43 % Total time : 0.011 s
% 0.11/0.43 % Maximum resident set size: 3604 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.022 s
% 0.11/0.43 % System time : 0.012 s
% 0.11/0.43 % Total time : 0.034 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------