TSTP Solution File: RNG123+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG123+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:14 EDT 2023
% Result : Theorem 0.33s 0.55s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 20 unt; 0 def)
% Number of atoms : 88 ( 8 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 87 ( 33 ~; 35 |; 12 &)
% ( 1 <=>; 6 =>; 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 : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',mEOfElem) ).
fof(m__2690,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__2690) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__2174) ).
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.lcUI0jGZ2M/E---3.1_1149.p',mDefIdeal) ).
fof(m__2699,hypothesis,
aElementOf0(xb,xI),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__2699) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',mAddComm) ).
fof(m__,conjecture,
aElementOf0(xr,xI),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__) ).
fof(m__2718,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__2718) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.lcUI0jGZ2M/E---3.1_1149.p',m__2091) ).
fof(c_0_9,plain,
! [X88,X89] :
( ~ aSet0(X88)
| ~ aElementOf0(X89,X88)
| aElement0(X89) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_10,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[m__2690]) ).
cnf(c_0_11,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_12,plain,
! [X49,X50,X51,X52,X53] :
( ( aSet0(X49)
| ~ aIdeal0(X49) )
& ( ~ aElementOf0(X51,X49)
| aElementOf0(sdtpldt0(X50,X51),X49)
| ~ aElementOf0(X50,X49)
| ~ aIdeal0(X49) )
& ( ~ aElement0(X52)
| aElementOf0(sdtasdt0(X52,X50),X49)
| ~ aElementOf0(X50,X49)
| ~ aIdeal0(X49) )
& ( aElementOf0(esk13_1(X53),X53)
| ~ aSet0(X53)
| aIdeal0(X53) )
& ( aElement0(esk15_1(X53))
| aElementOf0(esk14_1(X53),X53)
| ~ aSet0(X53)
| aIdeal0(X53) )
& ( ~ aElementOf0(sdtasdt0(esk15_1(X53),esk13_1(X53)),X53)
| aElementOf0(esk14_1(X53),X53)
| ~ aSet0(X53)
| aIdeal0(X53) )
& ( aElement0(esk15_1(X53))
| ~ aElementOf0(sdtpldt0(esk13_1(X53),esk14_1(X53)),X53)
| ~ aSet0(X53)
| aIdeal0(X53) )
& ( ~ aElementOf0(sdtasdt0(esk15_1(X53),esk13_1(X53)),X53)
| ~ aElementOf0(sdtpldt0(esk13_1(X53),esk14_1(X53)),X53)
| ~ aSet0(X53)
| aIdeal0(X53) ) ),
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,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_14,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
aIdeal0(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[m__2699]) ).
fof(c_0_19,plain,
! [X66,X67] :
( ~ aElement0(X66)
| ~ aElement0(X67)
| sdtpldt0(X66,X67) = sdtpldt0(X67,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
cnf(c_0_20,hypothesis,
( aElement0(smndt0(sdtasdt0(xq,xu)))
| ~ aSet0(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,hypothesis,
aSet0(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,negated_conjecture,
~ aElementOf0(xr,xI),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_23,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_24,hypothesis,
aElementOf0(xb,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[m__2718]) ).
cnf(c_0_26,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_28,hypothesis,
aElement0(smndt0(sdtasdt0(xq,xu))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,hypothesis,
( aElementOf0(sdtpldt0(xb,X1),sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| ~ aElementOf0(X1,sdtpldt1(slsdtgt0(xa),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_31,hypothesis,
sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) = xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[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,negated_conjecture,
~ aElementOf0(xr,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG123+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 19:45:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.lcUI0jGZ2M/E---3.1_1149.p
% 0.33/0.55 # Version: 3.1pre001
% 0.33/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.33/0.55 # Starting sh5l with 300s (1) cores
% 0.33/0.55 # new_bool_3 with pid 1271 completed with status 0
% 0.33/0.55 # Result found by new_bool_3
% 0.33/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.33/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.33/0.55 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 1279 completed with status 0
% 0.33/0.55 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.33/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.33/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.33/0.55 # Preprocessing time : 0.002 s
% 0.33/0.55 # Presaturation interreduction done
% 0.33/0.55
% 0.33/0.55 # Proof found!
% 0.33/0.55 # SZS status Theorem
% 0.33/0.55 # SZS output start CNFRefutation
% See solution above
% 0.33/0.55 # Parsed axioms : 55
% 0.33/0.55 # Removed by relevancy pruning/SinE : 5
% 0.33/0.55 # Initial clauses : 105
% 0.33/0.55 # Removed in clause preprocessing : 4
% 0.33/0.55 # Initial clauses in saturation : 101
% 0.33/0.55 # Processed clauses : 853
% 0.33/0.55 # ...of these trivial : 25
% 0.33/0.55 # ...subsumed : 325
% 0.33/0.55 # ...remaining for further processing : 503
% 0.33/0.55 # Other redundant clauses eliminated : 20
% 0.33/0.55 # Clauses deleted for lack of memory : 0
% 0.33/0.55 # Backward-subsumed : 32
% 0.33/0.55 # Backward-rewritten : 37
% 0.33/0.55 # Generated clauses : 2238
% 0.33/0.55 # ...of the previous two non-redundant : 1791
% 0.33/0.55 # ...aggressively subsumed : 0
% 0.33/0.55 # Contextual simplify-reflections : 13
% 0.33/0.55 # Paramodulations : 2220
% 0.33/0.55 # Factorizations : 0
% 0.33/0.55 # NegExts : 0
% 0.33/0.55 # Equation resolutions : 20
% 0.33/0.55 # Total rewrite steps : 2053
% 0.33/0.55 # Propositional unsat checks : 0
% 0.33/0.55 # Propositional check models : 0
% 0.33/0.55 # Propositional check unsatisfiable : 0
% 0.33/0.55 # Propositional clauses : 0
% 0.33/0.55 # Propositional clauses after purity: 0
% 0.33/0.55 # Propositional unsat core size : 0
% 0.33/0.55 # Propositional preprocessing time : 0.000
% 0.33/0.55 # Propositional encoding time : 0.000
% 0.33/0.55 # Propositional solver time : 0.000
% 0.33/0.55 # Success case prop preproc time : 0.000
% 0.33/0.55 # Success case prop encoding time : 0.000
% 0.33/0.55 # Success case prop solver time : 0.000
% 0.33/0.55 # Current number of processed clauses : 323
% 0.33/0.55 # Positive orientable unit clauses : 128
% 0.33/0.55 # Positive unorientable unit clauses: 0
% 0.33/0.55 # Negative unit clauses : 7
% 0.33/0.55 # Non-unit-clauses : 188
% 0.33/0.55 # Current number of unprocessed clauses: 1095
% 0.33/0.55 # ...number of literals in the above : 4134
% 0.33/0.55 # Current number of archived formulas : 0
% 0.33/0.55 # Current number of archived clauses : 170
% 0.33/0.55 # Clause-clause subsumption calls (NU) : 9835
% 0.33/0.55 # Rec. Clause-clause subsumption calls : 6342
% 0.33/0.55 # Non-unit clause-clause subsumptions : 367
% 0.33/0.55 # Unit Clause-clause subsumption calls : 204
% 0.33/0.55 # Rewrite failures with RHS unbound : 0
% 0.33/0.55 # BW rewrite match attempts : 51
% 0.33/0.55 # BW rewrite match successes : 27
% 0.33/0.55 # Condensation attempts : 0
% 0.33/0.55 # Condensation successes : 0
% 0.33/0.55 # Termbank termtop insertions : 40302
% 0.33/0.55
% 0.33/0.55 # -------------------------------------------------
% 0.33/0.55 # User time : 0.041 s
% 0.33/0.55 # System time : 0.005 s
% 0.33/0.55 # Total time : 0.047 s
% 0.33/0.55 # Maximum resident set size: 2044 pages
% 0.33/0.55
% 0.33/0.55 # -------------------------------------------------
% 0.33/0.55 # User time : 0.045 s
% 0.33/0.55 # System time : 0.006 s
% 0.33/0.55 # Total time : 0.051 s
% 0.33/0.55 # Maximum resident set size: 1740 pages
% 0.33/0.55 % E---3.1 exiting
% 0.33/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------