TSTP Solution File: RNG121+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:13 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 57 ( 18 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 54 ( 11 ~; 10 |; 32 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 4 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| aElementOf0(xb,xI) ),
file('/export/starexec/sandbox/tmp/tmp.8iVhEOvLlA/E---3.1_10743.p',m__) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.8iVhEOvLlA/E---3.1_10743.p',mAddZero) ).
fof(m__2203,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.8iVhEOvLlA/E---3.1_10743.p',m__2203) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.8iVhEOvLlA/E---3.1_10743.p',m__2091) ).
fof(c_0_4,negated_conjecture,
~ ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
| aElementOf0(xb,xI) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,negated_conjecture,
! [X160,X161] :
( ( ~ aElementOf0(X160,slsdtgt0(xa))
| ~ aElementOf0(X161,slsdtgt0(xb))
| sdtpldt0(X160,X161) != xb )
& ~ aElementOf0(xb,xI) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X17] :
( ( sdtpldt0(X17,sz00) = X17
| ~ aElement0(X17) )
& ( X17 = sdtpldt0(sz00,X17)
| ~ aElement0(X17) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_7,hypothesis,
( aElement0(esk28_0)
& sdtasdt0(xa,esk28_0) = sz00
& aElementOf0(sz00,slsdtgt0(xa))
& aElement0(esk29_0)
& sdtasdt0(xa,esk29_0) = xa
& aElementOf0(xa,slsdtgt0(xa))
& aElement0(esk30_0)
& sdtasdt0(xb,esk30_0) = sz00
& aElementOf0(sz00,slsdtgt0(xb))
& aElement0(esk31_0)
& sdtasdt0(xb,esk31_0) = xb
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2203])]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb))
| sdtpldt0(X1,X2) != xb ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])])]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 19:44:25 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.8iVhEOvLlA/E---3.1_10743.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10893 completed with status 0
% 0.21/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with pid 10904 completed with status 0
% 0.21/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.54 # Preprocessing time : 0.003 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 53
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 207
% 0.21/0.54 # Removed in clause preprocessing : 4
% 0.21/0.54 # Initial clauses in saturation : 203
% 0.21/0.54 # Processed clauses : 293
% 0.21/0.54 # ...of these trivial : 1
% 0.21/0.54 # ...subsumed : 8
% 0.21/0.54 # ...remaining for further processing : 284
% 0.21/0.54 # Other redundant clauses eliminated : 23
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 2
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 52
% 0.21/0.54 # ...of the previous two non-redundant : 43
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 1
% 0.21/0.54 # Paramodulations : 31
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 23
% 0.21/0.54 # Total rewrite steps : 29
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 68
% 0.21/0.54 # Positive orientable unit clauses : 48
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 7
% 0.21/0.54 # Non-unit-clauses : 13
% 0.21/0.54 # Current number of unprocessed clauses: 145
% 0.21/0.54 # ...number of literals in the above : 521
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 196
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 2666
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 779
% 0.21/0.54 # Non-unit clause-clause subsumptions : 6
% 0.21/0.54 # Unit Clause-clause subsumption calls : 13
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 2
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 12240
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.022 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.027 s
% 0.21/0.54 # Maximum resident set size: 2292 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.073 s
% 0.21/0.54 # System time : 0.017 s
% 0.21/0.54 # Total time : 0.090 s
% 0.21/0.54 # Maximum resident set size: 1760 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------