TSTP Solution File: RNG099+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG099+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Tue May 21 02:37:07 EDT 2024
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 106 ( 3 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 111 ( 40 ~; 35 |; 26 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& ( aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| sdteqdtlpzmzozddtrp0(X1,xx,xI) )
& ( aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| sdteqdtlpzmzozddtrp0(X1,xy,xJ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1332,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1332) ).
fof(m__1409,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1409) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1205,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/sandbox2/benchmark/theBenchmark.p',m__1205) ).
fof(m__1319,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1319) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1294,hypothesis,
( aElementOf0(xa,xI)
& aElementOf0(xb,xJ)
& sdtpldt0(xa,xb) = sz10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1294) ).
fof(m__1217,hypothesis,
( aElement0(xx)
& aElement0(xy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1217) ).
fof(c_0_10,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& ( aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| sdteqdtlpzmzozddtrp0(X1,xx,xI) )
& ( aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| sdteqdtlpzmzozddtrp0(X1,xy,xJ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,negated_conjecture,
! [X86] :
( ( ~ aElementOf0(sdtpldt0(X86,smndt0(xy)),xJ)
| ~ aElementOf0(sdtpldt0(X86,smndt0(xx)),xI)
| ~ aElement0(X86) )
& ( ~ sdteqdtlpzmzozddtrp0(X86,xy,xJ)
| ~ aElementOf0(sdtpldt0(X86,smndt0(xx)),xI)
| ~ aElement0(X86) )
& ( ~ aElementOf0(sdtpldt0(X86,smndt0(xy)),xJ)
| ~ sdteqdtlpzmzozddtrp0(X86,xx,xI)
| ~ aElement0(X86) )
& ( ~ sdteqdtlpzmzozddtrp0(X86,xy,xJ)
| ~ sdteqdtlpzmzozddtrp0(X86,xx,xI)
| ~ aElement0(X86) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X9,X10] :
( ~ aElement0(X9)
| ~ aElement0(X10)
| aElement0(sdtpldt0(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| ~ aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
inference(split_conjunct,[status(thm)],[m__1332]) ).
cnf(c_0_15,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
inference(split_conjunct,[status(thm)],[m__1409]) ).
fof(c_0_16,plain,
! [X34,X35] :
( ~ aSet0(X34)
| ~ aElementOf0(X35,X34)
| aElement0(X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_17,hypothesis,
! [X77,X78,X79,X80,X81,X82] :
( aSet0(xI)
& ( ~ aElementOf0(X78,xI)
| aElementOf0(sdtpldt0(X77,X78),xI)
| ~ aElementOf0(X77,xI) )
& ( ~ aElement0(X79)
| aElementOf0(sdtasdt0(X79,X77),xI)
| ~ aElementOf0(X77,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X81,xJ)
| aElementOf0(sdtpldt0(X80,X81),xJ)
| ~ aElementOf0(X80,xJ) )
& ( ~ aElement0(X82)
| aElementOf0(sdtasdt0(X82,X80),xJ)
| ~ aElementOf0(X80,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205])])])])]) ).
cnf(c_0_18,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
inference(split_conjunct,[status(thm)],[m__1319]) ).
cnf(c_0_20,hypothesis,
~ aElement0(xw),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_21,plain,
! [X11,X12] :
( ~ aElement0(X11)
| ~ aElement0(X12)
| aElement0(sdtasdt0(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_22,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xb,xJ),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_24,hypothesis,
aSet0(xJ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
( ~ aElement0(sdtasdt0(xx,xb))
| ~ aElement0(sdtasdt0(xy,xa)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
aElement0(xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xa,xI),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_30,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,hypothesis,
~ aElement0(sdtasdt0(xy,xa)),
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])]) ).
cnf(c_0_32,hypothesis,
aElement0(xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_30])]) ).
cnf(c_0_33,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_34,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG099+2 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n008.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.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sat May 18 12:22:08 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 19505 completed with status 0
% 0.18/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.18/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.18/0.49 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.18/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19513 completed with status 0
% 0.18/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.18/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.18/0.49 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 35
% 0.18/0.49 # Removed by relevancy pruning/SinE : 0
% 0.18/0.49 # Initial clauses : 82
% 0.18/0.49 # Removed in clause preprocessing : 2
% 0.18/0.49 # Initial clauses in saturation : 80
% 0.18/0.49 # Processed clauses : 133
% 0.18/0.49 # ...of these trivial : 0
% 0.18/0.49 # ...subsumed : 0
% 0.18/0.49 # ...remaining for further processing : 133
% 0.18/0.49 # Other redundant clauses eliminated : 10
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 1
% 0.18/0.49 # Backward-rewritten : 1
% 0.18/0.49 # Generated clauses : 36
% 0.18/0.49 # ...of the previous two non-redundant : 23
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 27
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 10
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 36
% 0.18/0.49 # ...of those cached : 26
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 42
% 0.18/0.49 # Positive orientable unit clauses : 20
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 3
% 0.18/0.49 # Non-unit-clauses : 19
% 0.18/0.49 # Current number of unprocessed clauses: 50
% 0.18/0.49 # ...number of literals in the above : 202
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 82
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 521
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 212
% 0.18/0.49 # Non-unit clause-clause subsumptions : 0
% 0.18/0.49 # Unit Clause-clause subsumption calls : 42
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 2
% 0.18/0.49 # BW rewrite match successes : 1
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 6563
% 0.18/0.49 # Search garbage collected termcells : 1249
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.006 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.010 s
% 0.18/0.49 # Maximum resident set size: 1920 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.028 s
% 0.18/0.49 # System time : 0.014 s
% 0.18/0.49 # Total time : 0.042 s
% 0.18/0.49 # Maximum resident set size: 1736 pages
% 0.18/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------