TSTP Solution File: NUN054+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : NUN054+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 13:29:56 EDT 2024
% Result : Theorem 0.39s 0.59s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 18 unt; 0 def)
% Number of atoms : 148 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 174 ( 71 ~; 58 |; 45 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 102 ( 2 sgn 32 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(zeroplusoneidone,conjecture,
? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X40,X46,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',zeroplusoneidone) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( id(X9,X8)
& r3(X6,X7,X9) )
| ( ~ r3(X6,X7,X9)
& ~ id(X9,X8) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_3) ).
fof(axiom_1a,axiom,
! [X38,X39] :
? [X40] :
( ? [X41] :
( id(X41,X40)
& ? [X42] :
( r2(X39,X42)
& r3(X38,X42,X41) ) )
& ? [X43] :
( r2(X43,X40)
& r3(X38,X39,X43) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_1a) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_8) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_4a) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_1) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox/tmp/tmp.lcgniKKViN/E---3.1_13350.p',axiom_5) ).
fof(c_0_7,negated_conjecture,
~ ? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X40,X46,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
inference(assume_negation,[status(cth)],[zeroplusoneidone]) ).
fof(c_0_8,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( id(X9,X8)
& r3(X6,X7,X9) )
| ( ~ r3(X6,X7,X9)
& ~ id(X9,X8) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_9,negated_conjecture,
! [X68,X69,X70,X71,X72,X73] :
( ~ r1(X70)
| ~ r3(X70,X69,X68)
| ~ r1(X71)
| ~ r2(X71,X69)
| ~ id(X68,X72)
| ~ r1(X73)
| ~ r2(X73,X72) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X81,X82] :
( id(esk3_2(X81,X82),esk2_2(X81,X82))
& r2(X82,esk4_2(X81,X82))
& r3(X81,esk4_2(X81,X82),esk3_2(X81,X82))
& r2(esk5_2(X81,X82),esk2_2(X81,X82))
& r3(X81,X82,esk5_2(X81,X82)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_11,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
fof(c_0_12,plain,
! [X111,X112,X114] :
( ( ~ r3(X111,X112,X114)
| id(X114,esk12_2(X111,X112)) )
& ( ~ id(X114,esk12_2(X111,X112))
| id(X114,esk12_2(X111,X112)) )
& ( ~ r3(X111,X112,X114)
| r3(X111,X112,X114) )
& ( ~ id(X114,esk12_2(X111,X112))
| r3(X111,X112,X114) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])])]) ).
fof(c_0_13,plain,
! [X102] :
( id(esk10_1(X102),X102)
& r1(esk11_1(X102))
& r3(X102,esk11_1(X102),esk10_1(X102)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_14,plain,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_15,negated_conjecture,
( ~ r1(X1)
| ~ r3(X1,X2,X3)
| ~ r1(X4)
| ~ r2(X4,X2)
| ~ id(X3,X5)
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
r3(X1,esk4_2(X1,X2),esk3_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X100,X101] :
( ( r1(X100)
| ~ r1(X100)
| ~ id(X100,X101) )
& ( r1(X101)
| ~ r1(X100)
| ~ id(X100,X101) )
& ( r1(X100)
| ~ r1(X101)
| ~ id(X100,X101) )
& ( r1(X101)
| ~ r1(X101)
| ~ id(X100,X101) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])])]) ).
cnf(c_0_18,plain,
( id(X3,esk12_2(X1,X2))
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X99] :
( ( ~ r1(X99)
| id(X99,esk9_0) )
& ( ~ id(X99,esk9_0)
| id(X99,esk9_0) )
& ( ~ r1(X99)
| r1(X99) )
& ( ~ id(X99,esk9_0)
| r1(X99) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ r2(X1,esk4_2(X2,X3))
| ~ r2(X4,X5)
| ~ r1(X4)
| ~ r1(X1)
| ~ r1(X2)
| ~ id(esk3_2(X2,X3),X5) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
r2(X1,esk4_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
r3(X1,X2,esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
id(esk10_1(X1),esk12_2(X1,esk11_1(X1))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( r1(X1)
| ~ id(X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
id(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1)
| ~ r1(X3)
| ~ r1(X4)
| ~ id(esk3_2(X4,X3),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
id(esk3_2(X1,X2),esk2_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
id(esk5_2(X1,X2),esk12_2(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_32,plain,
( r1(esk12_2(X1,esk11_1(X1)))
| ~ r1(esk10_1(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
r1(esk10_1(esk9_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X105] : id(X105,X105),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_35,negated_conjecture,
( ~ r2(X1,esk2_2(X2,X3))
| ~ r1(X1)
| ~ r1(X3)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
r2(esk5_2(X1,X2),esk2_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
( r1(esk5_2(X1,X2))
| ~ r1(esk12_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
r1(esk12_2(esk9_0,esk11_1(esk9_0))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ r1(esk5_2(X1,X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
r1(esk5_2(esk9_0,esk11_1(esk9_0))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
r1(esk9_0),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUN054+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Jun 18 21:08:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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/tmp/tmp.lcgniKKViN/E---3.1_13350.p
% 0.39/0.59 # Version: 3.2.0
% 0.39/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # new_bool_3 with pid 13429 completed with status 0
% 0.39/0.59 # Result found by new_bool_3
% 0.39/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.39/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 155s (1) cores
% 0.39/0.59 # H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with pid 13436 completed with status 0
% 0.39/0.59 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 0.39/0.59 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.39/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 155s (1) cores
% 0.39/0.59 # Preprocessing time : 0.001 s
% 0.39/0.59
% 0.39/0.59 # Proof found!
% 0.39/0.59 # SZS status Theorem
% 0.39/0.59 # SZS output start CNFRefutation
% See solution above
% 0.39/0.60 # Parsed axioms : 19
% 0.39/0.60 # Removed by relevancy pruning/SinE : 0
% 0.39/0.60 # Initial clauses : 59
% 0.39/0.60 # Removed in clause preprocessing : 16
% 0.39/0.60 # Initial clauses in saturation : 43
% 0.39/0.60 # Processed clauses : 627
% 0.39/0.60 # ...of these trivial : 55
% 0.39/0.60 # ...subsumed : 118
% 0.39/0.60 # ...remaining for further processing : 454
% 0.39/0.60 # Other redundant clauses eliminated : 0
% 0.39/0.60 # Clauses deleted for lack of memory : 0
% 0.39/0.60 # Backward-subsumed : 8
% 0.39/0.60 # Backward-rewritten : 5
% 0.39/0.60 # Generated clauses : 4122
% 0.39/0.60 # ...of the previous two non-redundant : 3409
% 0.39/0.60 # ...aggressively subsumed : 0
% 0.39/0.60 # Contextual simplify-reflections : 0
% 0.39/0.60 # Paramodulations : 4122
% 0.39/0.60 # Factorizations : 0
% 0.39/0.60 # NegExts : 0
% 0.39/0.60 # Equation resolutions : 0
% 0.39/0.60 # Disequality decompositions : 0
% 0.39/0.60 # Total rewrite steps : 898
% 0.39/0.60 # ...of those cached : 730
% 0.39/0.60 # Propositional unsat checks : 0
% 0.39/0.60 # Propositional check models : 0
% 0.39/0.60 # Propositional check unsatisfiable : 0
% 0.39/0.60 # Propositional clauses : 0
% 0.39/0.60 # Propositional clauses after purity: 0
% 0.39/0.60 # Propositional unsat core size : 0
% 0.39/0.60 # Propositional preprocessing time : 0.000
% 0.39/0.60 # Propositional encoding time : 0.000
% 0.39/0.60 # Propositional solver time : 0.000
% 0.39/0.60 # Success case prop preproc time : 0.000
% 0.39/0.60 # Success case prop encoding time : 0.000
% 0.39/0.60 # Success case prop solver time : 0.000
% 0.39/0.60 # Current number of processed clauses : 441
% 0.39/0.60 # Positive orientable unit clauses : 172
% 0.39/0.60 # Positive unorientable unit clauses: 0
% 0.39/0.60 # Negative unit clauses : 17
% 0.39/0.60 # Non-unit-clauses : 252
% 0.39/0.60 # Current number of unprocessed clauses: 2805
% 0.39/0.60 # ...number of literals in the above : 4431
% 0.39/0.60 # Current number of archived formulas : 0
% 0.39/0.60 # Current number of archived clauses : 13
% 0.39/0.60 # Clause-clause subsumption calls (NU) : 9754
% 0.39/0.60 # Rec. Clause-clause subsumption calls : 6161
% 0.39/0.60 # Non-unit clause-clause subsumptions : 98
% 0.39/0.60 # Unit Clause-clause subsumption calls : 1600
% 0.39/0.60 # Rewrite failures with RHS unbound : 0
% 0.39/0.60 # BW rewrite match attempts : 245
% 0.39/0.60 # BW rewrite match successes : 4
% 0.39/0.60 # Condensation attempts : 0
% 0.39/0.60 # Condensation successes : 0
% 0.39/0.60 # Termbank termtop insertions : 42999
% 0.39/0.60 # Search garbage collected termcells : 430
% 0.39/0.60
% 0.39/0.60 # -------------------------------------------------
% 0.39/0.60 # User time : 0.052 s
% 0.39/0.60 # System time : 0.005 s
% 0.39/0.60 # Total time : 0.057 s
% 0.39/0.60 # Maximum resident set size: 1892 pages
% 0.39/0.60
% 0.39/0.60 # -------------------------------------------------
% 0.39/0.60 # User time : 0.052 s
% 0.39/0.60 # System time : 0.008 s
% 0.39/0.60 # Total time : 0.061 s
% 0.39/0.60 # Maximum resident set size: 1752 pages
% 0.39/0.60 % E---3.1 exiting
% 0.39/0.60 % E exiting
%------------------------------------------------------------------------------