TSTP Solution File: RNG115+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG115+4 : 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:12 EDT 2023
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 72 ( 29 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 94 ( 33 ~; 26 |; 33 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn; 9 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.RkZqaBVU9k/E---3.1_14684.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/sandbox2/tmp/tmp.RkZqaBVU9k/E---3.1_14684.p',m__2273) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,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_4,negated_conjecture,
! [X154,X155,X156,X157] :
( ( ~ aElement0(X157)
| sdtasdt0(xb,X157) != X155
| ~ aElement0(X156)
| sdtasdt0(xa,X156) != X154
| xu != sdtpldt0(X154,X155) )
& ( ~ aElementOf0(X155,slsdtgt0(xb))
| ~ aElement0(X156)
| sdtasdt0(xa,X156) != X154
| xu != sdtpldt0(X154,X155) )
& ( ~ aElement0(X157)
| sdtasdt0(xb,X157) != X155
| ~ aElementOf0(X154,slsdtgt0(xa))
| xu != sdtpldt0(X154,X155) )
& ( ~ aElementOf0(X155,slsdtgt0(xb))
| ~ aElementOf0(X154,slsdtgt0(xa))
| xu != sdtpldt0(X154,X155) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5,hypothesis,
! [X149,X150,X151] :
( aElementOf0(esk37_0,slsdtgt0(xa))
& aElementOf0(esk38_0,slsdtgt0(xb))
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X150,slsdtgt0(xa))
| ~ aElementOf0(X151,slsdtgt0(xb))
| sdtpldt0(X150,X151) != X149
| X149 = sz00
| ~ iLess0(sbrdtbr0(X149),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X149,xI)
| X149 = sz00
| ~ iLess0(sbrdtbr0(X149),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa))
| xu != sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
sdtpldt0(esk37_0,esk38_0) = xu,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aElementOf0(esk37_0,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(esk38_0,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : RNG115+4 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 19:38:53 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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/tmp/tmp.RkZqaBVU9k/E---3.1_14684.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14762 completed with status 0
% 0.18/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.18/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.18/0.48 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 14775 completed with status 0
% 0.18/0.48 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.18/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.18/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.18/0.48 # Preprocessing time : 0.004 s
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 47
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 192
% 0.18/0.48 # Removed in clause preprocessing : 4
% 0.18/0.48 # Initial clauses in saturation : 188
% 0.18/0.48 # Processed clauses : 62
% 0.18/0.48 # ...of these trivial : 1
% 0.18/0.48 # ...subsumed : 0
% 0.18/0.48 # ...remaining for further processing : 61
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 53
% 0.18/0.48 # ...of the previous two non-redundant : 40
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 53
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Total rewrite steps : 27
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 61
% 0.18/0.48 # Positive orientable unit clauses : 36
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 3
% 0.18/0.48 # Non-unit-clauses : 22
% 0.18/0.48 # Current number of unprocessed clauses: 166
% 0.18/0.48 # ...number of literals in the above : 590
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 0
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 84
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 62
% 0.18/0.48 # Non-unit clause-clause subsumptions : 0
% 0.18/0.48 # Unit Clause-clause subsumption calls : 2
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 10015
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.011 s
% 0.18/0.48 # System time : 0.007 s
% 0.18/0.48 # Total time : 0.018 s
% 0.18/0.48 # Maximum resident set size: 2284 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.040 s
% 0.18/0.48 # System time : 0.013 s
% 0.18/0.48 # Total time : 0.053 s
% 0.18/0.48 # Maximum resident set size: 1760 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------