TSTP Solution File: RNG108+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG108+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 09:15:22 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 99 ( 25 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 122 ( 50 ~; 48 |; 19 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',mDefPrIdeal) ).
fof(m__,conjecture,
( aElementOf0(sz00,slsdtgt0(xa))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',m__) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',mMulZero) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',mSortsC) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',m__2091) ).
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',mMulUnit) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p',mSortsC_01) ).
fof(c_0_7,plain,
! [X105,X106,X107,X109,X110,X111,X113] :
( ( aSet0(X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( aElement0(esk18_3(X105,X106,X107))
| ~ aElementOf0(X107,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( sdtasdt0(X105,esk18_3(X105,X106,X107)) = X107
| ~ aElementOf0(X107,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( ~ aElement0(X110)
| sdtasdt0(X105,X110) != X109
| aElementOf0(X109,X106)
| X106 != slsdtgt0(X105)
| ~ aElement0(X105) )
& ( ~ aElementOf0(esk19_2(X105,X111),X111)
| ~ aElement0(X113)
| sdtasdt0(X105,X113) != esk19_2(X105,X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) )
& ( aElement0(esk20_2(X105,X111))
| aElementOf0(esk19_2(X105,X111),X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) )
& ( sdtasdt0(X105,esk20_2(X105,X111)) = esk19_2(X105,X111)
| aElementOf0(esk19_2(X105,X111),X111)
| ~ aSet0(X111)
| X111 = slsdtgt0(X105)
| ~ aElement0(X105) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( aElementOf0(sz00,slsdtgt0(xa))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( aElementOf0(X3,X4)
| ~ aElement0(X1)
| sdtasdt0(X2,X1) != X3
| X4 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X30] :
( ( sdtasdt0(X30,sz00) = sz00
| ~ aElement0(X30) )
& ( sz00 = sdtasdt0(sz00,X30)
| ~ aElement0(X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])])]) ).
fof(c_0_11,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_12,plain,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_15,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( aElementOf0(sz00,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_18,plain,
! [X25] :
( ( sdtasdt0(X25,sz10) = X25
| ~ aElement0(X25) )
& ( X25 = sdtasdt0(sz10,X25)
| ~ aElement0(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_21,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20])]) ).
cnf(c_0_24,plain,
( aElementOf0(X1,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
~ aElementOf0(xb,slsdtgt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG108+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 11:24:04 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jwfXG33si0/E---3.1_6264.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 6345 completed with status 0
% 0.19/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.19/0.49 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 6357 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.19/0.49 # Preprocessing time : 0.003 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 43
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 100
% 0.19/0.49 # Removed in clause preprocessing : 4
% 0.19/0.49 # Initial clauses in saturation : 96
% 0.19/0.49 # Processed clauses : 228
% 0.19/0.49 # ...of these trivial : 4
% 0.19/0.49 # ...subsumed : 9
% 0.19/0.49 # ...remaining for further processing : 215
% 0.19/0.49 # Other redundant clauses eliminated : 17
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 5
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 271
% 0.19/0.49 # ...of the previous two non-redundant : 230
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 1
% 0.19/0.49 # Paramodulations : 256
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 17
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 158
% 0.19/0.49 # ...of those cached : 144
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 98
% 0.19/0.49 # Positive orientable unit clauses : 24
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 72
% 0.19/0.49 # Current number of unprocessed clauses: 189
% 0.19/0.49 # ...number of literals in the above : 796
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 103
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 2945
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 1135
% 0.19/0.49 # Non-unit clause-clause subsumptions : 13
% 0.19/0.49 # Unit Clause-clause subsumption calls : 8
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 3
% 0.19/0.49 # BW rewrite match successes : 3
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 12443
% 0.19/0.49 # Search garbage collected termcells : 1858
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.023 s
% 0.19/0.49 # System time : 0.006 s
% 0.19/0.49 # Total time : 0.029 s
% 0.19/0.49 # Maximum resident set size: 2048 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.094 s
% 0.19/0.49 # System time : 0.019 s
% 0.19/0.49 # Total time : 0.113 s
% 0.19/0.49 # Maximum resident set size: 1744 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------