TSTP Solution File: NUN060+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : NUN060+1 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:58 EDT 2024
% Result : Theorem 0.23s 0.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 126 ( 49 ~; 38 |; 39 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 0 con; 1-2 aty)
% Number of variables : 103 ( 11 sgn 32 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(greq4id,conjecture,
? [X63,X46,X47] :
( id(X47,X63)
& ? [X40] :
( r3(X46,X40,X47)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r2(X49,X41)
& ? [X43] :
( r2(X43,X49)
& ? [X58] :
( r1(X58)
& r2(X58,X43) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',greq4id) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_6) ).
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/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_1a) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_4a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_2) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_5) ).
fof(axiom_2a,axiom,
! [X44,X45] :
? [X46] :
( ? [X47] :
( id(X47,X46)
& ? [X48] :
( r2(X45,X48)
& r4(X44,X48,X47) ) )
& ? [X49] :
( r3(X49,X44,X46)
& r4(X44,X45,X49) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dE6hzdMndi/E---3.1_30015.p',axiom_2a) ).
fof(c_0_7,negated_conjecture,
~ ? [X63,X46,X47] :
( id(X47,X63)
& ? [X40] :
( r3(X46,X40,X47)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r2(X49,X41)
& ? [X43] :
( r2(X43,X49)
& ? [X58] :
( r1(X58)
& r2(X58,X43) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[greq4id]) ).
fof(c_0_8,plain,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_9,negated_conjecture,
! [X68,X69,X70,X71,X72,X73,X74,X75] :
( ~ id(X70,X68)
| ~ r3(X69,X71,X70)
| ~ r2(X72,X71)
| ~ r2(X73,X72)
| ~ r2(X74,X73)
| ~ r1(X75)
| ~ r2(X75,X74) ),
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,
! [X83,X84] :
( id(esk3_2(X83,X84),esk2_2(X83,X84))
& r2(X84,esk4_2(X83,X84))
& r3(X83,esk4_2(X83,X84),esk3_2(X83,X84))
& r2(esk5_2(X83,X84),esk2_2(X83,X84))
& r3(X83,X84,esk5_2(X83,X84)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_11,plain,
! [X124,X125] :
( ~ id(X124,X125)
| id(X125,X124) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_12,plain,
! [X104] :
( id(esk10_1(X104),X104)
& r1(esk11_1(X104))
& r3(X104,esk11_1(X104),esk10_1(X104)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_13,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_14,negated_conjecture,
( ~ id(X1,X2)
| ~ r3(X3,X4,X1)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r2(X7,X6)
| ~ r1(X8)
| ~ r2(X8,X7) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
r3(X1,X2,esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( id(X2,X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
id(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X76,X78] :
( ( ~ r2(X76,X78)
| id(X78,esk1_1(X76)) )
& ( ~ id(X78,esk1_1(X76))
| id(X78,esk1_1(X76)) )
& ( ~ r2(X76,X78)
| r2(X76,X78) )
& ( ~ id(X78,esk1_1(X76))
| r2(X76,X78) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_13])])])]) ).
fof(c_0_19,plain,
! [X123] : id(X123,X123),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_20,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r1(X1)
| ~ id(esk5_2(X6,X5),X7) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
id(X1,esk10_1(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( r2(X2,X1)
| ~ id(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
r2(X1,esk1_1(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ r2(esk1_1(X1),X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( ~ r2(esk1_1(esk1_1(X1)),X2)
| ~ r2(X2,X3)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
fof(c_0_28,plain,
! [X117,X118] :
( id(esk14_2(X117,X118),esk13_2(X117,X118))
& r2(X118,esk15_2(X117,X118))
& r4(X117,esk15_2(X117,X118),esk14_2(X117,X118))
& r3(esk16_2(X117,X118),X117,esk13_2(X117,X118))
& r4(X117,X118,esk16_2(X117,X118)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])]) ).
cnf(c_0_29,negated_conjecture,
( ~ r2(esk1_1(esk1_1(esk1_1(X1))),X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_30,plain,
r2(X1,esk15_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN060+1 : TPTP v8.2.0. Released v7.3.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n004.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Tue Jun 18 21:18:09 EDT 2024
% 0.13/0.37 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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/tmp/tmp.dE6hzdMndi/E---3.1_30015.p
% 0.23/0.52 # Version: 3.2.0
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 # Starting sh5l with 300s (1) cores
% 0.23/0.52 # new_bool_3 with pid 30094 completed with status 0
% 0.23/0.52 # Result found by new_bool_3
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.52 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.23/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 155s (1) cores
% 0.23/0.52 # H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with pid 30098 completed with status 0
% 0.23/0.52 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.52 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.23/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 155s (1) cores
% 0.23/0.52 # Preprocessing time : 0.001 s
% 0.23/0.52
% 0.23/0.52 # Proof found!
% 0.23/0.52 # SZS status Theorem
% 0.23/0.52 # SZS output start CNFRefutation
% See solution above
% 0.23/0.52 # Parsed axioms : 19
% 0.23/0.52 # Removed by relevancy pruning/SinE : 0
% 0.23/0.52 # Initial clauses : 59
% 0.23/0.52 # Removed in clause preprocessing : 16
% 0.23/0.52 # Initial clauses in saturation : 43
% 0.23/0.52 # Processed clauses : 102
% 0.23/0.52 # ...of these trivial : 0
% 0.23/0.52 # ...subsumed : 6
% 0.23/0.52 # ...remaining for further processing : 96
% 0.23/0.52 # Other redundant clauses eliminated : 0
% 0.23/0.52 # Clauses deleted for lack of memory : 0
% 0.23/0.52 # Backward-subsumed : 28
% 0.23/0.52 # Backward-rewritten : 0
% 0.23/0.52 # Generated clauses : 301
% 0.23/0.52 # ...of the previous two non-redundant : 250
% 0.23/0.52 # ...aggressively subsumed : 0
% 0.23/0.52 # Contextual simplify-reflections : 0
% 0.23/0.52 # Paramodulations : 293
% 0.23/0.52 # Factorizations : 0
% 0.23/0.52 # NegExts : 0
% 0.23/0.52 # Equation resolutions : 0
% 0.23/0.52 # Disequality decompositions : 0
% 0.23/0.52 # Total rewrite steps : 55
% 0.23/0.52 # ...of those cached : 36
% 0.23/0.52 # Propositional unsat checks : 0
% 0.23/0.52 # Propositional check models : 0
% 0.23/0.52 # Propositional check unsatisfiable : 0
% 0.23/0.52 # Propositional clauses : 0
% 0.23/0.52 # Propositional clauses after purity: 0
% 0.23/0.52 # Propositional unsat core size : 0
% 0.23/0.52 # Propositional preprocessing time : 0.000
% 0.23/0.52 # Propositional encoding time : 0.000
% 0.23/0.52 # Propositional solver time : 0.000
% 0.23/0.52 # Success case prop preproc time : 0.000
% 0.23/0.52 # Success case prop encoding time : 0.000
% 0.23/0.52 # Success case prop solver time : 0.000
% 0.23/0.52 # Current number of processed clauses : 60
% 0.23/0.52 # Positive orientable unit clauses : 26
% 0.23/0.52 # Positive unorientable unit clauses: 0
% 0.23/0.52 # Negative unit clauses : 1
% 0.23/0.52 # Non-unit-clauses : 33
% 0.23/0.52 # Current number of unprocessed clauses: 189
% 0.23/0.52 # ...number of literals in the above : 425
% 0.23/0.52 # Current number of archived formulas : 0
% 0.23/0.52 # Current number of archived clauses : 36
% 0.23/0.52 # Clause-clause subsumption calls (NU) : 360
% 0.23/0.52 # Rec. Clause-clause subsumption calls : 195
% 0.23/0.52 # Non-unit clause-clause subsumptions : 7
% 0.23/0.52 # Unit Clause-clause subsumption calls : 201
% 0.23/0.52 # Rewrite failures with RHS unbound : 0
% 0.23/0.52 # BW rewrite match attempts : 12
% 0.23/0.52 # BW rewrite match successes : 0
% 0.23/0.52 # Condensation attempts : 0
% 0.23/0.52 # Condensation successes : 0
% 0.23/0.52 # Termbank termtop insertions : 5608
% 0.23/0.52 # Search garbage collected termcells : 442
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.008 s
% 0.23/0.52 # System time : 0.005 s
% 0.23/0.52 # Total time : 0.013 s
% 0.23/0.52 # Maximum resident set size: 1888 pages
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.009 s
% 0.23/0.52 # System time : 0.008 s
% 0.23/0.52 # Total time : 0.017 s
% 0.23/0.52 # Maximum resident set size: 1752 pages
% 0.23/0.52 % E---3.1 exiting
% 0.23/0.52 % E exiting
%------------------------------------------------------------------------------