%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUN089+1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:57:43 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 130 ( 60 ~; 46 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 54 ( 3 sgn 38 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(zerounidtwo,conjecture,
! [X63] :
( ! [X40] :
( ~ r1(X40)
| ~ id(X40,X63) )
| ! [X46] :
( ~ r2(X46,X63)
| ! [X47] :
( ~ r2(X47,X46)
| ~ r1(X47) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerounidtwo) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ( r1(X21)
& r1(X20) )
| ( ~ r1(X21)
& ~ r1(X20) )
| ~ id(X20,X21) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_8) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r1(X2) )
| ( r1(X2)
& id(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1) ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ~ r2(X65,X66)
| ! [X67] :
( ~ r1(X67)
| ~ id(X67,X66) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(axiom_5a,axiom,
! [X57] :
? [X58] :
( ? [X60] :
( r1(X60)
& id(X58,X60) )
& ? [X59] :
( r4(X57,X59,X58)
& r1(X59) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_5a) ).
fof(axiom_6,axiom,
! [X15,X16] :
( id(X16,X15)
| ~ id(X15,X16) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_6) ).
fof(c_0_6,negated_conjecture,
~ ! [X63] :
( ! [X40] :
( ~ r1(X40)
| ~ id(X40,X63) )
| ! [X46] :
( ~ r2(X46,X63)
| ! [X47] :
( ~ r2(X47,X46)
| ~ r1(X47) ) ) ),
inference(assume_negation,[status(cth)],[zerounidtwo]) ).
fof(c_0_7,plain,
! [X20,X21] :
( ( r1(X21)
& r1(X20) )
| ( ~ r1(X21)
& ~ r1(X20) )
| ~ id(X20,X21) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
fof(c_0_8,negated_conjecture,
~ ! [X63] :
( ! [X40] :
( ~ r1(X40)
| ~ id(X40,X63) )
| ! [X46] :
( ~ r2(X46,X63)
| ! [X47] :
( ~ r2(X47,X46)
| ~ r1(X47) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r1(X2) )
| ( r1(X2)
& id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_10,plain,
! [X74,X75] :
( ( ~ id(X74,X75)
| ~ r1(X75)
| r1(X75) )
& ( ~ id(X74,X75)
| ~ r1(X75)
| r1(X74) )
& ( ~ id(X74,X75)
| ~ r1(X74)
| r1(X75) )
& ( ~ id(X74,X75)
| ~ r1(X74)
| r1(X74) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,negated_conjecture,
( r1(esk4_0)
& id(esk4_0,esk1_0)
& r2(esk2_0,esk1_0)
& r2(esk3_0,esk2_0)
& r1(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X65,X66] :
( ~ r2(X65,X66)
| ! [X67] :
( ~ r1(X67)
| ~ id(X67,X66) ) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_13,plain,
! [X73] :
( ( r1(X73)
| ~ id(X73,esk5_0) )
& ( r1(X73)
| ~ r1(X73) )
& ( id(X73,esk5_0)
| ~ id(X73,esk5_0) )
& ( id(X73,esk5_0)
| ~ r1(X73) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,plain,
! [X135] :
( r1(esk24_1(X135))
& id(esk22_1(X135),esk24_1(X135))
& r4(X135,esk23_1(X135),esk22_1(X135))
& r1(esk23_1(X135)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
fof(c_0_15,plain,
! [X15,X16] :
( id(X16,X15)
| ~ id(X15,X16) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
cnf(c_0_16,plain,
( ~ id(X2,X1)
| ~ r1(X2)
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
id(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
r1(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X83,X84,X85] :
( ~ r2(X83,X84)
| ~ r1(X85)
| ~ id(X85,X84) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])])]) ).
cnf(c_0_20,plain,
( ~ r1(X1)
| id(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
r1(esk24_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X87,X88] :
( id(X88,X87)
| ~ id(X87,X88) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_23,negated_conjecture,
r1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
( ~ r2(X3,X2)
| ~ r1(X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
r2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
id(esk24_1(X1),esk5_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ id(X1,X2)
| id(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
id(esk1_0,esk5_0),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ id(X1,esk1_0)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
r1(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
id(esk5_0,esk1_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN089+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n010.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 : Mon Sep 21 03:26:09 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_3 with pid 4129650 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHNM-FFMS21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 4129661 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHNM-FFMS21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 19
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 63
% 0.14/0.43 % Removed in clause preprocessing : 16
% 0.14/0.43 % Initial clauses in saturation : 47
% 0.14/0.43 % Processed clauses : 84
% 0.14/0.43 % ...of these trivial : 4
% 0.14/0.43 % ...subsumed : 7
% 0.14/0.43 % ...remaining for further processing : 73
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 0
% 0.14/0.43 % Generated clauses : 150
% 0.14/0.43 % ...of the previous two non-redundant : 93
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 150
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 82
% 0.14/0.43 % ...of those cached : 59
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 73
% 0.14/0.43 % Positive orientable unit clauses : 44
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 8
% 0.14/0.43 % Non-unit-clauses : 21
% 0.14/0.43 % Current number of unprocessed clauses: 49
% 0.14/0.43 % ...number of literals in the above : 126
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 0
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 83
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 78
% 0.14/0.43 % Non-unit clause-clause subsumptions : 7
% 0.14/0.43 % Unit Clause-clause subsumption calls : 110
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 3
% 0.14/0.43 % BW rewrite match successes : 0
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 4093
% 0.14/0.43 % Search garbage collected termcells : 392
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.009 s
% 0.14/0.43 % System time : 0.000 s
% 0.14/0.43 % Total time : 0.009 s
% 0.14/0.43 % Maximum resident set size: 3696 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.011 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.015 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------