TSTP Solution File: RNG102+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG102+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:45 EDT 2023
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 68 ( 21 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 89 ( 37 ~; 37 |; 12 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn; 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
file('/export/starexec/sandbox/tmp/tmp.j3hM1tNwrB/E---3.1_11052.p',m__) ).
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.j3hM1tNwrB/E---3.1_11052.p',mDefPrIdeal) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/tmp/tmp.j3hM1tNwrB/E---3.1_11052.p',m__1905) ).
fof(m__1933,hypothesis,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/tmp/tmp.j3hM1tNwrB/E---3.1_11052.p',m__1933) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X14,X15,X16,X18,X19,X20,X22] :
( ( aSet0(X15)
| X15 != slsdtgt0(X14)
| ~ aElement0(X14) )
& ( aElement0(esk3_3(X14,X15,X16))
| ~ aElementOf0(X16,X15)
| X15 != slsdtgt0(X14)
| ~ aElement0(X14) )
& ( sdtasdt0(X14,esk3_3(X14,X15,X16)) = X16
| ~ aElementOf0(X16,X15)
| X15 != slsdtgt0(X14)
| ~ aElement0(X14) )
& ( ~ aElement0(X19)
| sdtasdt0(X14,X19) != X18
| aElementOf0(X18,X15)
| X15 != slsdtgt0(X14)
| ~ aElement0(X14) )
& ( ~ aElementOf0(esk4_2(X14,X20),X20)
| ~ aElement0(X22)
| sdtasdt0(X14,X22) != esk4_2(X14,X20)
| ~ aSet0(X20)
| X20 = slsdtgt0(X14)
| ~ aElement0(X14) )
& ( aElement0(esk5_2(X14,X20))
| aElementOf0(esk4_2(X14,X20),X20)
| ~ aSet0(X20)
| X20 = slsdtgt0(X14)
| ~ aElement0(X14) )
& ( sdtasdt0(X14,esk5_2(X14,X20)) = esk4_2(X14,X20)
| aElementOf0(esk4_2(X14,X20),X20)
| ~ aSet0(X20)
| X20 = slsdtgt0(X14)
| ~ aElement0(X14) ) ),
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_6,negated_conjecture,
! [X7] :
( ~ aElement0(X7)
| sdtasdt0(xc,X7) != xy ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
( sdtasdt0(X1,esk3_3(X1,X2,X3)) = X3
| ~ aElementOf0(X3,X2)
| X2 != slsdtgt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != xy ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( sdtasdt0(X1,esk3_3(X1,slsdtgt0(X1),X2)) = X2
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xy,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[m__1933]) ).
cnf(c_0_12,plain,
( aElement0(esk3_3(X1,X2,X3))
| ~ aElementOf0(X3,X2)
| X2 != slsdtgt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ aElement0(esk3_3(xc,slsdtgt0(xc),xy)),
inference(cn,[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])]) ).
cnf(c_0_14,plain,
( aElement0(esk3_3(X1,slsdtgt0(X1),X2))
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG102+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 20:14:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/tmp/tmp.j3hM1tNwrB/E---3.1_11052.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 11130 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 11133 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 41
% 0.21/0.51 # Removed by relevancy pruning/SinE : 20
% 0.21/0.51 # Initial clauses : 43
% 0.21/0.51 # Removed in clause preprocessing : 2
% 0.21/0.51 # Initial clauses in saturation : 41
% 0.21/0.51 # Processed clauses : 129
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 36
% 0.21/0.51 # ...remaining for further processing : 92
% 0.21/0.51 # Other redundant clauses eliminated : 12
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 2
% 0.21/0.51 # Generated clauses : 143
% 0.21/0.51 # ...of the previous two non-redundant : 121
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 1
% 0.21/0.51 # Paramodulations : 124
% 0.21/0.51 # Factorizations : 8
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 12
% 0.21/0.51 # Total rewrite steps : 92
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 45
% 0.21/0.51 # Positive orientable unit clauses : 9
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 3
% 0.21/0.51 # Non-unit-clauses : 33
% 0.21/0.51 # Current number of unprocessed clauses: 74
% 0.21/0.51 # ...number of literals in the above : 315
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 43
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 455
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 260
% 0.21/0.51 # Non-unit clause-clause subsumptions : 27
% 0.21/0.51 # Unit Clause-clause subsumption calls : 15
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 2
% 0.21/0.51 # BW rewrite match successes : 2
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4920
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.010 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.013 s
% 0.21/0.51 # Maximum resident set size: 1848 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.013 s
% 0.21/0.51 # System time : 0.005 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1736 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------