TSTP Solution File: RNG090+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG090+1 : TPTP v8.1.2. Released v4.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:15:04 EDT 2023
% Result : Theorem 2.10s 0.78s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 22 unt; 0 def)
% Number of atoms : 122 ( 18 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 127 ( 49 ~; 50 |; 19 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn; 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',mDefIdeal) ).
fof(m__,conjecture,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',m__) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',mAddAsso) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',mAddComm) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',mEOfElem) ).
fof(m__870,hypothesis,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',m__870) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',mSortsB) ).
fof(m__934,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',m__934) ).
fof(m__967,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',m__967) ).
fof(m__994,hypothesis,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox/tmp/tmp.YSWFaGIC2v/E---3.1_6372.p',m__994) ).
fof(c_0_10,plain,
! [X7,X8,X9,X10,X11] :
( ( aSet0(X7)
| ~ aIdeal0(X7) )
& ( ~ aElementOf0(X9,X7)
| aElementOf0(sdtpldt0(X8,X9),X7)
| ~ aElementOf0(X8,X7)
| ~ aIdeal0(X7) )
& ( ~ aElement0(X10)
| aElementOf0(sdtasdt0(X10,X8),X7)
| ~ aElementOf0(X8,X7)
| ~ aIdeal0(X7) )
& ( aElementOf0(esk1_1(X11),X11)
| ~ aSet0(X11)
| aIdeal0(X11) )
& ( aElement0(esk3_1(X11))
| aElementOf0(esk2_1(X11),X11)
| ~ aSet0(X11)
| aIdeal0(X11) )
& ( ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11)
| aElementOf0(esk2_1(X11),X11)
| ~ aSet0(X11)
| aIdeal0(X11) )
& ( aElement0(esk3_1(X11))
| ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
| ~ aSet0(X11)
| aIdeal0(X11) )
& ( ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11)
| ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
| ~ aSet0(X11)
| aIdeal0(X11) ) ),
inference(distribute,[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)],[mDefIdeal])])])])])]) ).
fof(c_0_11,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_12,plain,
! [X34,X35,X36] :
( ~ aElement0(X34)
| ~ aElement0(X35)
| ~ aElement0(X36)
| sdtpldt0(sdtpldt0(X34,X35),X36) = sdtpldt0(X34,sdtpldt0(X35,X36)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_13,plain,
! [X32,X33] :
( ~ aElement0(X32)
| ~ aElement0(X33)
| sdtpldt0(X32,X33) = sdtpldt0(X33,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
fof(c_0_14,plain,
! [X47,X48] :
( ~ aSet0(X47)
| ~ aElementOf0(X48,X47)
| aElement0(X48) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_17,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__870]) ).
fof(c_0_18,plain,
! [X30,X31] :
( ~ aElement0(X30)
| ~ aElement0(X31)
| aElement0(sdtpldt0(X30,X31)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_19,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,hypothesis,
xx = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_21,hypothesis,
xy = sdtpldt0(xm,xn),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_22,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,hypothesis,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(split_conjunct,[status(thm)],[m__994]) ).
cnf(c_0_26,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_28,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_30,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) != sdtpldt0(sdtpldt0(xk,xl),sdtpldt0(xm,xn)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_32,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X2,sdtpldt0(X1,X3))
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_33,hypothesis,
aElement0(sdtpldt0(xl,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_34,hypothesis,
aElement0(xk),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_28])]) ).
cnf(c_0_35,hypothesis,
aElement0(xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_28])]) ).
cnf(c_0_36,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(X3,sdtpldt0(X1,X2))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_30]) ).
cnf(c_0_37,hypothesis,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_38,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_39,negated_conjecture,
sdtpldt0(xm,sdtpldt0(xk,sdtpldt0(xl,xn))) != sdtpldt0(sdtpldt0(xk,xl),sdtpldt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
( sdtpldt0(X1,sdtpldt0(X2,sdtpldt0(X3,X4))) = sdtpldt0(sdtpldt0(X2,X3),sdtpldt0(X1,X4))
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_36]),c_0_30]) ).
cnf(c_0_41,hypothesis,
aElement0(xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_37]),c_0_26])]) ).
cnf(c_0_42,hypothesis,
aElement0(xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_38]),c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_35]),c_0_42]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : RNG090+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 20:12:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.YSWFaGIC2v/E---3.1_6372.p
% 2.10/0.78 # Version: 3.1pre001
% 2.10/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.10/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.10/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.10/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.10/0.78 # Starting sh5l with 300s (1) cores
% 2.10/0.78 # new_bool_3 with pid 6451 completed with status 0
% 2.10/0.78 # Result found by new_bool_3
% 2.10/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.10/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.10/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.10/0.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.10/0.78 # Search class: FGUSF-FFMM32-SFFFFFNN
% 2.10/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.10/0.78 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.10/0.78 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6455 completed with status 0
% 2.10/0.78 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.10/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.10/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.10/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.10/0.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.10/0.78 # Search class: FGUSF-FFMM32-SFFFFFNN
% 2.10/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.10/0.78 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.10/0.78 # Preprocessing time : 0.002 s
% 2.10/0.78 # Presaturation interreduction done
% 2.10/0.78
% 2.10/0.78 # Proof found!
% 2.10/0.78 # SZS status Theorem
% 2.10/0.78 # SZS output start CNFRefutation
% See solution above
% 2.10/0.78 # Parsed axioms : 31
% 2.10/0.78 # Removed by relevancy pruning/SinE : 11
% 2.10/0.78 # Initial clauses : 48
% 2.10/0.78 # Removed in clause preprocessing : 2
% 2.10/0.78 # Initial clauses in saturation : 46
% 2.10/0.78 # Processed clauses : 2536
% 2.10/0.78 # ...of these trivial : 610
% 2.10/0.78 # ...subsumed : 674
% 2.10/0.78 # ...remaining for further processing : 1252
% 2.10/0.78 # Other redundant clauses eliminated : 6
% 2.10/0.78 # Clauses deleted for lack of memory : 0
% 2.10/0.78 # Backward-subsumed : 27
% 2.10/0.78 # Backward-rewritten : 0
% 2.10/0.78 # Generated clauses : 18686
% 2.10/0.78 # ...of the previous two non-redundant : 16994
% 2.10/0.78 # ...aggressively subsumed : 0
% 2.10/0.78 # Contextual simplify-reflections : 77
% 2.10/0.78 # Paramodulations : 18681
% 2.10/0.78 # Factorizations : 0
% 2.10/0.78 # NegExts : 0
% 2.10/0.78 # Equation resolutions : 6
% 2.10/0.78 # Total rewrite steps : 18524
% 2.10/0.78 # Propositional unsat checks : 0
% 2.10/0.78 # Propositional check models : 0
% 2.10/0.78 # Propositional check unsatisfiable : 0
% 2.10/0.78 # Propositional clauses : 0
% 2.10/0.78 # Propositional clauses after purity: 0
% 2.10/0.78 # Propositional unsat core size : 0
% 2.10/0.78 # Propositional preprocessing time : 0.000
% 2.10/0.78 # Propositional encoding time : 0.000
% 2.10/0.78 # Propositional solver time : 0.000
% 2.10/0.78 # Success case prop preproc time : 0.000
% 2.10/0.78 # Success case prop encoding time : 0.000
% 2.10/0.78 # Success case prop solver time : 0.000
% 2.10/0.78 # Current number of processed clauses : 1174
% 2.10/0.78 # Positive orientable unit clauses : 611
% 2.10/0.78 # Positive unorientable unit clauses: 0
% 2.10/0.78 # Negative unit clauses : 3
% 2.10/0.78 # Non-unit-clauses : 560
% 2.10/0.78 # Current number of unprocessed clauses: 14358
% 2.10/0.78 # ...number of literals in the above : 58888
% 2.10/0.78 # Current number of archived formulas : 0
% 2.10/0.78 # Current number of archived clauses : 73
% 2.10/0.78 # Clause-clause subsumption calls (NU) : 66718
% 2.10/0.78 # Rec. Clause-clause subsumption calls : 50855
% 2.10/0.78 # Non-unit clause-clause subsumptions : 761
% 2.10/0.78 # Unit Clause-clause subsumption calls : 7998
% 2.10/0.78 # Rewrite failures with RHS unbound : 0
% 2.10/0.78 # BW rewrite match attempts : 10650
% 2.10/0.78 # BW rewrite match successes : 17
% 2.10/0.78 # Condensation attempts : 0
% 2.10/0.78 # Condensation successes : 0
% 2.10/0.78 # Termbank termtop insertions : 323399
% 2.10/0.78
% 2.10/0.78 # -------------------------------------------------
% 2.10/0.78 # User time : 0.249 s
% 2.10/0.78 # System time : 0.012 s
% 2.10/0.78 # Total time : 0.261 s
% 2.10/0.78 # Maximum resident set size: 1864 pages
% 2.10/0.78
% 2.10/0.78 # -------------------------------------------------
% 2.10/0.78 # User time : 0.251 s
% 2.10/0.78 # System time : 0.014 s
% 2.10/0.78 # Total time : 0.265 s
% 2.10/0.78 # Maximum resident set size: 1732 pages
% 2.10/0.78 % E---3.1 exiting
% 2.10/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------