TSTP Solution File: RNG088+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG088+2 : TPTP v8.1.2. Released v4.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:15:04 EDT 2023
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 94 ( 2 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 110 ( 35 ~; 36 |; 29 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 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 : 26 ( 0 sgn; 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox/tmp/tmp.B1IbnmBrRD/E---3.1_24568.p',m__) ).
fof(m__870,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/tmp/tmp.B1IbnmBrRD/E---3.1_24568.p',m__870) ).
fof(m__934,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/tmp/tmp.B1IbnmBrRD/E---3.1_24568.p',m__934) ).
fof(m__967,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/tmp/tmp.B1IbnmBrRD/E---3.1_24568.p',m__967) ).
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.B1IbnmBrRD/E---3.1_24568.p',mDefIdeal) ).
fof(c_0_5,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,hypothesis,
! [X68,X69,X70,X71,X72,X73] :
( aSet0(xI)
& ( ~ aElementOf0(X69,xI)
| aElementOf0(sdtpldt0(X68,X69),xI)
| ~ aElementOf0(X68,xI) )
& ( ~ aElement0(X70)
| aElementOf0(sdtasdt0(X70,X68),xI)
| ~ aElementOf0(X68,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X72,xJ)
| aElementOf0(sdtpldt0(X71,X72),xJ)
| ~ aElementOf0(X71,xJ) )
& ( ~ aElement0(X73)
| aElementOf0(sdtasdt0(X73,X71),xJ)
| ~ aElementOf0(X71,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__870])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(sdtpldt0(X2,X1),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X2,xJ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[m__967]) ).
fof(c_0_12,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])])])])])]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( aElementOf0(sdtpldt0(X3,X1),X2)
| ~ aElementOf0(X1,X2)
| ~ aElementOf0(X3,X2)
| ~ aIdeal0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG088+2 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 19:34:30 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.51 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.B1IbnmBrRD/E---3.1_24568.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 24694 completed with status 0
% 0.22/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.22/0.54 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.22/0.54 # G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 24704 completed with status 0
% 0.22/0.54 # Result found by G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.22/0.54 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/0.54 # Preprocessing time : 0.002 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 29
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 78
% 0.22/0.54 # Removed in clause preprocessing : 2
% 0.22/0.54 # Initial clauses in saturation : 76
% 0.22/0.54 # Processed clauses : 154
% 0.22/0.54 # ...of these trivial : 0
% 0.22/0.54 # ...subsumed : 0
% 0.22/0.54 # ...remaining for further processing : 154
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 1
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 255
% 0.22/0.54 # ...of the previous two non-redundant : 220
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 249
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 6
% 0.22/0.54 # Total rewrite steps : 101
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 77
% 0.22/0.54 # Positive orientable unit clauses : 21
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 2
% 0.22/0.54 # Non-unit-clauses : 54
% 0.22/0.54 # Current number of unprocessed clauses: 218
% 0.22/0.54 # ...number of literals in the above : 892
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 77
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 965
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 267
% 0.22/0.54 # Non-unit clause-clause subsumptions : 0
% 0.22/0.54 # Unit Clause-clause subsumption calls : 4
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 0
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 8780
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.017 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.021 s
% 0.22/0.54 # Maximum resident set size: 1908 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.072 s
% 0.22/0.54 # System time : 0.015 s
% 0.22/0.54 # Total time : 0.087 s
% 0.22/0.54 # Maximum resident set size: 1732 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------