TSTP Solution File: RNG120+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG120+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:36:28 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 121 ( 14 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 139 ( 55 ~; 49 |; 24 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
& smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulMnOne) ).
fof(m__,conjecture,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsU) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2666) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_10,plain,
! [X62,X63,X64,X65,X66] :
( ( aSet0(X62)
| ~ aIdeal0(X62) )
& ( ~ aElementOf0(X64,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X63,X62)
| ~ aIdeal0(X62) )
& ( ~ aElement0(X65)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElementOf0(X63,X62)
| ~ aIdeal0(X62) )
& ( aElementOf0(esk9_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( aElement0(esk11_1(X66))
| aElementOf0(esk10_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( aElement0(esk11_1(X66))
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aSet0(X66)
| aIdeal0(X66) ) ),
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)],[mDefIdeal])])])])])])]) ).
fof(c_0_11,plain,
! [X29] :
( ( sdtasdt0(smndt0(sz10),X29) = smndt0(X29)
| ~ aElement0(X29) )
& ( smndt0(X29) = sdtasdt0(X29,smndt0(sz10))
| ~ aElement0(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
fof(c_0_12,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElement0(X1)
| ~ aElementOf0(X2,X3)
| ~ aIdeal0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X8] :
( ~ aElement0(X8)
| aElement0(smndt0(X8)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
fof(c_0_16,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( aElementOf0(smndt0(X1),X2)
| ~ aIdeal0(X2)
| ~ aElementOf0(X1,X2)
| ~ aElement0(smndt0(sz10))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( aElement0(smndt0(X1))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
fof(c_0_20,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_21,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( aElementOf0(smndt0(X1),X2)
| ~ aIdeal0(X2)
| ~ aElementOf0(X1,X2)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_24,hypothesis,
! [X117] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X117,xI)
| X117 = sz00
| ~ iLess0(sbrdtbr0(X117),sbrdtbr0(xu)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_25,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])])])]) ).
cnf(c_0_26,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xq,xu),xI)
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_30,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_31,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_23]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG120+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.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 : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 12:13:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.55 # Version: 3.1.0
% 0.22/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4789 completed with status 0
% 0.22/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.22/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.55 # Starting sh5l with 136s (1) cores
% 0.22/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4797 completed with status 0
% 0.22/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.22/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.55 # Preprocessing time : 0.004 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 52
% 0.22/0.55 # Removed by relevancy pruning/SinE : 0
% 0.22/0.55 # Initial clauses : 120
% 0.22/0.55 # Removed in clause preprocessing : 4
% 0.22/0.55 # Initial clauses in saturation : 116
% 0.22/0.55 # Processed clauses : 437
% 0.22/0.55 # ...of these trivial : 3
% 0.22/0.55 # ...subsumed : 90
% 0.22/0.55 # ...remaining for further processing : 344
% 0.22/0.55 # Other redundant clauses eliminated : 18
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 14
% 0.22/0.55 # Backward-rewritten : 6
% 0.22/0.55 # Generated clauses : 747
% 0.22/0.55 # ...of the previous two non-redundant : 625
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 6
% 0.22/0.55 # Paramodulations : 731
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 18
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 390
% 0.22/0.55 # ...of those cached : 365
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 194
% 0.22/0.55 # Positive orientable unit clauses : 38
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 10
% 0.22/0.55 # Non-unit-clauses : 146
% 0.22/0.55 # Current number of unprocessed clauses: 372
% 0.22/0.55 # ...number of literals in the above : 2035
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 136
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 3365
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 1188
% 0.22/0.55 # Non-unit clause-clause subsumptions : 104
% 0.22/0.55 # Unit Clause-clause subsumption calls : 47
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 6
% 0.22/0.55 # BW rewrite match successes : 6
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 20526
% 0.22/0.55 # Search garbage collected termcells : 1913
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.040 s
% 0.22/0.55 # System time : 0.005 s
% 0.22/0.55 # Total time : 0.045 s
% 0.22/0.55 # Maximum resident set size: 2048 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.178 s
% 0.22/0.55 # System time : 0.019 s
% 0.22/0.55 # Total time : 0.197 s
% 0.22/0.55 # Maximum resident set size: 1756 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------