TSTP Solution File: RNG105+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG105+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:09 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 98 ( 21 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 113 ( 47 ~; 45 |; 16 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn; 18 !; 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.dnGuWeIumF/E---3.1_4444.p',mDefPrIdeal) ).
fof(m__,conjecture,
( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
& aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__) ).
fof(m__2010,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__2010) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__1905) ).
fof(m__2043,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__2043) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',mSortsB) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__1979) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__1956) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',mSortsB_02) ).
fof(m__1933,hypothesis,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/tmp/tmp.dnGuWeIumF/E---3.1_4444.p',m__1933) ).
fof(c_0_10,plain,
! [X13,X14,X15,X17,X18,X19,X21] :
( ( aSet0(X14)
| X14 != slsdtgt0(X13)
| ~ aElement0(X13) )
& ( aElement0(esk3_3(X13,X14,X15))
| ~ aElementOf0(X15,X14)
| X14 != slsdtgt0(X13)
| ~ aElement0(X13) )
& ( sdtasdt0(X13,esk3_3(X13,X14,X15)) = X15
| ~ aElementOf0(X15,X14)
| X14 != slsdtgt0(X13)
| ~ aElement0(X13) )
& ( ~ aElement0(X18)
| sdtasdt0(X13,X18) != X17
| aElementOf0(X17,X14)
| X14 != slsdtgt0(X13)
| ~ aElement0(X13) )
& ( ~ aElementOf0(esk4_2(X13,X19),X19)
| ~ aElement0(X21)
| sdtasdt0(X13,X21) != esk4_2(X13,X19)
| ~ aSet0(X19)
| X19 = slsdtgt0(X13)
| ~ aElement0(X13) )
& ( aElement0(esk5_2(X13,X19))
| aElementOf0(esk4_2(X13,X19),X19)
| ~ aSet0(X19)
| X19 = slsdtgt0(X13)
| ~ aElement0(X13) )
& ( sdtasdt0(X13,esk5_2(X13,X19)) = esk4_2(X13,X19)
| aElementOf0(esk4_2(X13,X19),X19)
| ~ aSet0(X19)
| X19 = slsdtgt0(X13)
| ~ aElement0(X13) ) ),
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)],[mDefPrIdeal])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
& aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_12,plain,
( aElementOf0(X3,X4)
| ~ aElement0(X1)
| sdtasdt0(X2,X1) != X3
| X4 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_15,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_16,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_17,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
| ~ aElement0(sdtpldt0(xu,xv)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[m__2043]) ).
cnf(c_0_20,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElement0(sdtpldt0(xu,xv)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_16])]) ).
fof(c_0_22,plain,
! [X33,X34] :
( ~ aElement0(X33)
| ~ aElement0(X34)
| aElement0(sdtpldt0(X33,X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_23,hypothesis,
( ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_26,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
fof(c_0_27,plain,
! [X23,X24] :
( ~ aElement0(X23)
| ~ aElement0(X24)
| aElement0(sdtasdt0(X23,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_28,hypothesis,
~ aElement0(sdtasdt0(xu,xz)),
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_29,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__1933]) ).
cnf(c_0_31,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : RNG105+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n027.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Oct 2 20:08:30 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.dnGuWeIumF/E---3.1_4444.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 4524 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 4526 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 44
% 0.21/0.53 # Removed by relevancy pruning/SinE : 20
% 0.21/0.53 # Initial clauses : 47
% 0.21/0.53 # Removed in clause preprocessing : 2
% 0.21/0.53 # Initial clauses in saturation : 45
% 0.21/0.53 # Processed clauses : 86
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 86
% 0.21/0.53 # Other redundant clauses eliminated : 7
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 2
% 0.21/0.53 # Backward-rewritten : 2
% 0.21/0.53 # Generated clauses : 68
% 0.21/0.53 # ...of the previous two non-redundant : 53
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 54
% 0.21/0.53 # Factorizations : 8
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 7
% 0.21/0.53 # Total rewrite steps : 66
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 33
% 0.21/0.53 # Positive orientable unit clauses : 13
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 19
% 0.21/0.53 # Current number of unprocessed clauses: 55
% 0.21/0.53 # ...number of literals in the above : 177
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 49
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 161
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 78
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 5
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 2
% 0.21/0.53 # BW rewrite match successes : 2
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 4047
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.006 s
% 0.21/0.53 # System time : 0.004 s
% 0.21/0.53 # Total time : 0.010 s
% 0.21/0.53 # Maximum resident set size: 1840 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.010 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.015 s
% 0.21/0.53 # Maximum resident set size: 1732 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------