TSTP Solution File: RNG095+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG095+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:06 EDT 2023
% Result : Theorem 5.77s 1.21s
% Output : CNFRefutation 5.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 156 ( 25 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 210 ( 84 ~; 92 |; 26 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 58 ( 0 sgn; 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( aElementOf0(X5,X1)
& aElementOf0(X6,X2)
& sdtpldt0(X5,X6) = X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4NI9xhpkYM/E---3.1_3781.p',mDefSSum) ).
fof(m__1205_03,hypothesis,
! [X1] :
( aElement0(X1)
=> aElementOf0(X1,sdtpldt1(xI,xJ)) ),
file('/export/starexec/sandbox/tmp/tmp.4NI9xhpkYM/E---3.1_3781.p',m__1205_03) ).
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.4NI9xhpkYM/E---3.1_3781.p',mDefIdeal) ).
fof(m__,conjecture,
? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sz10 ),
file('/export/starexec/sandbox/tmp/tmp.4NI9xhpkYM/E---3.1_3781.p',m__) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/tmp/tmp.4NI9xhpkYM/E---3.1_3781.p',mSortsC_01) ).
fof(m__1205,hypothesis,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/tmp/tmp.4NI9xhpkYM/E---3.1_3781.p',m__1205) ).
fof(c_0_6,plain,
! [X38,X39,X40,X41,X44,X45,X46,X47,X49,X50] :
( ( aSet0(X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk3_4(X38,X39,X40,X41),X38)
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk4_4(X38,X39,X40,X41),X39)
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( sdtpldt0(esk3_4(X38,X39,X40,X41),esk4_4(X38,X39,X40,X41)) = X41
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( ~ aElementOf0(X45,X38)
| ~ aElementOf0(X46,X39)
| sdtpldt0(X45,X46) != X44
| aElementOf0(X44,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( ~ aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aElementOf0(X49,X38)
| ~ aElementOf0(X50,X39)
| sdtpldt0(X49,X50) != esk5_3(X38,X39,X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk6_3(X38,X39,X47),X38)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk7_3(X38,X39,X47),X39)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( sdtpldt0(esk6_3(X38,X39,X47),esk7_3(X38,X39,X47)) = esk5_3(X38,X39,X47)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) ) ),
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)],[mDefSSum])])])])])]) ).
fof(c_0_7,hypothesis,
! [X75] :
( ~ aElement0(X75)
| aElementOf0(X75,sdtpldt1(xI,xJ)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205_03])]) ).
fof(c_0_8,plain,
! [X60,X61,X62,X63,X64] :
( ( aSet0(X60)
| ~ aIdeal0(X60) )
& ( ~ aElementOf0(X62,X60)
| aElementOf0(sdtpldt0(X61,X62),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( ~ aElement0(X63)
| aElementOf0(sdtasdt0(X63,X61),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( aElementOf0(esk9_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) ) ),
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_9,negated_conjecture,
~ ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sz10 ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4
| ~ aElementOf0(X4,X3)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,sdtpldt1(xI,xJ))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_13,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_15,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_16,plain,
( aElementOf0(esk4_4(X1,X2,X3,X4),X2)
| ~ aElementOf0(X4,X3)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( aElementOf0(esk3_4(X1,X2,X3,X4),X1)
| ~ aElementOf0(X4,X3)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,negated_conjecture,
! [X76,X77] :
( ~ aElementOf0(X76,xI)
| ~ aElementOf0(X77,xJ)
| sdtpldt0(X76,X77) != sz10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_19,plain,
( sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3)) = X3
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_20,hypothesis,
aElementOf0(sz10,sdtpldt1(xI,xJ)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_23,plain,
( aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtpldt0(X1,X2) != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
sdtpldt0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10)) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
aElementOf0(esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,hypothesis,
aElementOf0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG095+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 20:08:15 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.4NI9xhpkYM/E---3.1_3781.p
% 5.77/1.21 # Version: 3.1pre001
% 5.77/1.21 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.77/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.77/1.21 # Starting new_bool_3 with 300s (1) cores
% 5.77/1.21 # Starting new_bool_1 with 300s (1) cores
% 5.77/1.21 # Starting sh5l with 300s (1) cores
% 5.77/1.21 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3860 completed with status 0
% 5.77/1.21 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.77/1.21 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.77/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.77/1.21 # No SInE strategy applied
% 5.77/1.21 # Search class: FGHSF-FFMM32-SFFFFFNN
% 5.77/1.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.77/1.21 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 5.77/1.21 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 5.77/1.21 # G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 3868 completed with status 0
% 5.77/1.21 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 5.77/1.21 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.77/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.77/1.21 # No SInE strategy applied
% 5.77/1.21 # Search class: FGHSF-FFMM32-SFFFFFNN
% 5.77/1.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.77/1.21 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.77/1.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 5.77/1.21 # Preprocessing time : 0.002 s
% 5.77/1.21 # Presaturation interreduction done
% 5.77/1.21
% 5.77/1.21 # Proof found!
% 5.77/1.21 # SZS status Theorem
% 5.77/1.21 # SZS output start CNFRefutation
% See solution above
% 5.77/1.22 # Parsed axioms : 31
% 5.77/1.22 # Removed by relevancy pruning/SinE : 0
% 5.77/1.22 # Initial clauses : 64
% 5.77/1.22 # Removed in clause preprocessing : 2
% 5.77/1.22 # Initial clauses in saturation : 62
% 5.77/1.22 # Processed clauses : 2129
% 5.77/1.22 # ...of these trivial : 484
% 5.77/1.22 # ...subsumed : 124
% 5.77/1.22 # ...remaining for further processing : 1521
% 5.77/1.22 # Other redundant clauses eliminated : 10
% 5.77/1.22 # Clauses deleted for lack of memory : 0
% 5.77/1.22 # Backward-subsumed : 18
% 5.77/1.22 # Backward-rewritten : 145
% 5.77/1.22 # Generated clauses : 79360
% 5.77/1.22 # ...of the previous two non-redundant : 78469
% 5.77/1.22 # ...aggressively subsumed : 0
% 5.77/1.22 # Contextual simplify-reflections : 0
% 5.77/1.22 # Paramodulations : 79351
% 5.77/1.22 # Factorizations : 0
% 5.77/1.22 # NegExts : 0
% 5.77/1.22 # Equation resolutions : 10
% 5.77/1.22 # Total rewrite steps : 50323
% 5.77/1.22 # Propositional unsat checks : 0
% 5.77/1.22 # Propositional check models : 0
% 5.77/1.22 # Propositional check unsatisfiable : 0
% 5.77/1.22 # Propositional clauses : 0
% 5.77/1.22 # Propositional clauses after purity: 0
% 5.77/1.22 # Propositional unsat core size : 0
% 5.77/1.22 # Propositional preprocessing time : 0.000
% 5.77/1.22 # Propositional encoding time : 0.000
% 5.77/1.22 # Propositional solver time : 0.000
% 5.77/1.22 # Success case prop preproc time : 0.000
% 5.77/1.22 # Success case prop encoding time : 0.000
% 5.77/1.22 # Success case prop solver time : 0.000
% 5.77/1.22 # Current number of processed clauses : 1287
% 5.77/1.22 # Positive orientable unit clauses : 563
% 5.77/1.22 # Positive unorientable unit clauses: 0
% 5.77/1.22 # Negative unit clauses : 5
% 5.77/1.22 # Non-unit-clauses : 719
% 5.77/1.22 # Current number of unprocessed clauses: 76283
% 5.77/1.22 # ...number of literals in the above : 90255
% 5.77/1.22 # Current number of archived formulas : 0
% 5.77/1.22 # Current number of archived clauses : 225
% 5.77/1.22 # Clause-clause subsumption calls (NU) : 51428
% 5.77/1.22 # Rec. Clause-clause subsumption calls : 30877
% 5.77/1.22 # Non-unit clause-clause subsumptions : 101
% 5.77/1.22 # Unit Clause-clause subsumption calls : 6497
% 5.77/1.22 # Rewrite failures with RHS unbound : 0
% 5.77/1.22 # BW rewrite match attempts : 3010
% 5.77/1.22 # BW rewrite match successes : 49
% 5.77/1.22 # Condensation attempts : 0
% 5.77/1.22 # Condensation successes : 0
% 5.77/1.22 # Termbank termtop insertions : 1640387
% 5.77/1.22
% 5.77/1.22 # -------------------------------------------------
% 5.77/1.22 # User time : 0.706 s
% 5.77/1.22 # System time : 0.038 s
% 5.77/1.22 # Total time : 0.743 s
% 5.77/1.22 # Maximum resident set size: 1896 pages
% 5.77/1.22
% 5.77/1.22 # -------------------------------------------------
% 5.77/1.22 # User time : 3.595 s
% 5.77/1.22 # System time : 0.137 s
% 5.77/1.22 # Total time : 3.733 s
% 5.77/1.22 # Maximum resident set size: 1712 pages
% 5.77/1.22 % E---3.1 exiting
% 5.77/1.22 % E---3.1 exiting
%------------------------------------------------------------------------------