TSTP Solution File: RNG119+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG119+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:14 EDT 2024
% Result : Theorem 0.35s 0.54s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 149 ( 45 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 169 ( 54 ~; 46 |; 56 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 39 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xr != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2174,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)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(m__2612,hypothesis,
~ ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
| doDivides0(xu,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2612) ).
fof(c_0_9,negated_conjecture,
xr = sz00,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_10,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_11,plain,
! [X18] :
( ( sdtpldt0(X18,sz00) = X18
| ~ aElement0(X18) )
& ( X18 = sdtpldt0(sz00,X18)
| ~ aElement0(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
cnf(c_0_12,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_13,negated_conjecture,
xr = sz00,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,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_15,hypothesis,
! [X154,X155,X156] :
( aElementOf0(esk37_0,slsdtgt0(xa))
& aElementOf0(esk38_0,slsdtgt0(xb))
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X155,slsdtgt0(xa))
| ~ aElementOf0(X156,slsdtgt0(xb))
| sdtpldt0(X155,X156) != X154
| X154 = sz00
| ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X154,xI)
| X154 = sz00
| ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])]) ).
fof(c_0_16,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( aSet0(xI)
& ( ~ aElementOf0(X123,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X122,xI) )
& ( ~ aElement0(X124)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElementOf0(X122,xI) )
& aIdeal0(xI)
& ( aElement0(esk24_1(X125))
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk24_1(X125)) = X125
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( ~ aElement0(X128)
| sdtasdt0(xa,X128) != X127
| aElementOf0(X127,slsdtgt0(xa)) )
& ( aElement0(esk25_1(X129))
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk25_1(X129)) = X129
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( ~ aElement0(X132)
| sdtasdt0(xb,X132) != X131
| aElementOf0(X131,slsdtgt0(xb)) )
& ( aElementOf0(esk26_1(X133),slsdtgt0(xa))
| ~ aElementOf0(X133,xI) )
& ( aElementOf0(esk27_1(X133),slsdtgt0(xb))
| ~ aElementOf0(X133,xI) )
& ( sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133
| ~ aElementOf0(X133,xI) )
& ( ~ aElementOf0(X137,slsdtgt0(xa))
| ~ aElementOf0(X138,slsdtgt0(xb))
| sdtpldt0(X137,X138) != X136
| aElementOf0(X136,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
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)],[m__2174])])])])])])]) ).
cnf(c_0_17,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
sdtpldt0(sdtasdt0(xq,xu),sz00) = xb,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,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_20,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
( sdtasdt0(xq,xu) = xb
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_27,plain,
! [X20,X21] :
( ~ aElement0(X20)
| ~ aElement0(X21)
| sdtasdt0(X20,X21) = sdtasdt0(X21,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_28,hypothesis,
! [X162] :
( ( ~ aElement0(X162)
| sdtasdt0(xu,X162) != xb )
& ~ doDivides0(xu,xb) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2612])])])]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(xq,xu) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
( ~ aElement0(X1)
| sdtasdt0(xu,X1) != xb ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,hypothesis,
sdtasdt0(xu,xq) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_25])]) ).
cnf(c_0_33,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG119+4 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.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:10:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.35/0.54 # Version: 3.1.0
% 0.35/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.54 # Starting sh5l with 300s (1) cores
% 0.35/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16977 completed with status 0
% 0.35/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.35/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.54 # No SInE strategy applied
% 0.35/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.35/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.35/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.35/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.35/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.35/0.54 # SAT001_MinMin_p005000_rr_RG with pid 16985 completed with status 0
% 0.35/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.35/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.54 # No SInE strategy applied
% 0.35/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.35/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.35/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.35/0.54 # Preprocessing time : 0.003 s
% 0.35/0.54 # Presaturation interreduction done
% 0.35/0.54
% 0.35/0.54 # Proof found!
% 0.35/0.54 # SZS status Theorem
% 0.35/0.54 # SZS output start CNFRefutation
% See solution above
% 0.35/0.54 # Parsed axioms : 51
% 0.35/0.54 # Removed by relevancy pruning/SinE : 0
% 0.35/0.54 # Initial clauses : 201
% 0.35/0.54 # Removed in clause preprocessing : 4
% 0.35/0.54 # Initial clauses in saturation : 197
% 0.35/0.54 # Processed clauses : 392
% 0.35/0.54 # ...of these trivial : 5
% 0.35/0.54 # ...subsumed : 24
% 0.35/0.54 # ...remaining for further processing : 363
% 0.35/0.54 # Other redundant clauses eliminated : 26
% 0.35/0.54 # Clauses deleted for lack of memory : 0
% 0.35/0.54 # Backward-subsumed : 5
% 0.35/0.54 # Backward-rewritten : 13
% 0.35/0.54 # Generated clauses : 230
% 0.35/0.54 # ...of the previous two non-redundant : 148
% 0.35/0.54 # ...aggressively subsumed : 0
% 0.35/0.54 # Contextual simplify-reflections : 3
% 0.35/0.54 # Paramodulations : 206
% 0.35/0.54 # Factorizations : 0
% 0.35/0.54 # NegExts : 0
% 0.35/0.54 # Equation resolutions : 26
% 0.35/0.54 # Disequality decompositions : 0
% 0.35/0.54 # Total rewrite steps : 275
% 0.35/0.54 # ...of those cached : 235
% 0.35/0.54 # Propositional unsat checks : 0
% 0.35/0.54 # Propositional check models : 0
% 0.35/0.54 # Propositional check unsatisfiable : 0
% 0.35/0.54 # Propositional clauses : 0
% 0.35/0.54 # Propositional clauses after purity: 0
% 0.35/0.54 # Propositional unsat core size : 0
% 0.35/0.54 # Propositional preprocessing time : 0.000
% 0.35/0.54 # Propositional encoding time : 0.000
% 0.35/0.54 # Propositional solver time : 0.000
% 0.35/0.54 # Success case prop preproc time : 0.000
% 0.35/0.54 # Success case prop encoding time : 0.000
% 0.35/0.54 # Success case prop solver time : 0.000
% 0.35/0.54 # Current number of processed clauses : 141
% 0.35/0.54 # Positive orientable unit clauses : 60
% 0.35/0.54 # Positive unorientable unit clauses: 0
% 0.35/0.54 # Negative unit clauses : 9
% 0.35/0.54 # Non-unit-clauses : 72
% 0.35/0.54 # Current number of unprocessed clauses: 136
% 0.35/0.54 # ...number of literals in the above : 534
% 0.35/0.54 # Current number of archived formulas : 0
% 0.35/0.54 # Current number of archived clauses : 202
% 0.35/0.54 # Clause-clause subsumption calls (NU) : 3445
% 0.35/0.54 # Rec. Clause-clause subsumption calls : 1157
% 0.35/0.54 # Non-unit clause-clause subsumptions : 21
% 0.35/0.54 # Unit Clause-clause subsumption calls : 56
% 0.35/0.54 # Rewrite failures with RHS unbound : 0
% 0.35/0.54 # BW rewrite match attempts : 11
% 0.35/0.54 # BW rewrite match successes : 11
% 0.35/0.54 # Condensation attempts : 0
% 0.35/0.54 # Condensation successes : 0
% 0.35/0.54 # Termbank termtop insertions : 15668
% 0.35/0.54 # Search garbage collected termcells : 2659
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.024 s
% 0.35/0.54 # System time : 0.009 s
% 0.35/0.54 # Total time : 0.032 s
% 0.35/0.54 # Maximum resident set size: 2296 pages
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.093 s
% 0.35/0.54 # System time : 0.023 s
% 0.35/0.54 # Total time : 0.115 s
% 0.35/0.54 # Maximum resident set size: 1772 pages
% 0.35/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------