TSTP Solution File: RNG116+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG116+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.40s 0.53s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 34 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 9 ~; 5 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn; 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.CjzLQtg9ez/E---3.1_32185.p',m__) ).
fof(m__2456,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xk )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xl )
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/tmp/tmp.CjzLQtg9ez/E---3.1_32185.p',m__2456) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X52,X53] :
( ~ aElement0(X52)
| ~ aElement0(X53)
| xu != sdtpldt0(sdtasdt0(xa,X52),sdtasdt0(xb,X53)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_4,hypothesis,
( aElement0(esk19_0)
& sdtasdt0(xa,esk19_0) = xk
& aElementOf0(xk,slsdtgt0(xa))
& aElement0(esk20_0)
& sdtasdt0(xb,esk20_0) = xl
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2456])]) ).
cnf(c_0_5,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtasdt0(xa,esk19_0) = xk,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElement0(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( sdtpldt0(xk,sdtasdt0(xb,X1)) != xu
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(xb,esk20_0) = xl,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,hypothesis,
xu = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
aElement0(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG116+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 19:45:38 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.CjzLQtg9ez/E---3.1_32185.p
% 0.40/0.53 # Version: 3.1pre001
% 0.40/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.53 # Starting sh5l with 300s (1) cores
% 0.40/0.53 # new_bool_3 with pid 32294 completed with status 0
% 0.40/0.53 # Result found by new_bool_3
% 0.40/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.40/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.40/0.53 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 32300 completed with status 0
% 0.40/0.53 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.40/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.40/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.40/0.53 # Preprocessing time : 0.002 s
% 0.40/0.53 # Presaturation interreduction done
% 0.40/0.53
% 0.40/0.53 # Proof found!
% 0.40/0.53 # SZS status Theorem
% 0.40/0.53 # SZS output start CNFRefutation
% See solution above
% 0.40/0.53 # Parsed axioms : 48
% 0.40/0.53 # Removed by relevancy pruning/SinE : 11
% 0.40/0.53 # Initial clauses : 169
% 0.40/0.53 # Removed in clause preprocessing : 4
% 0.40/0.53 # Initial clauses in saturation : 165
% 0.40/0.53 # Processed clauses : 360
% 0.40/0.53 # ...of these trivial : 3
% 0.40/0.53 # ...subsumed : 6
% 0.40/0.53 # ...remaining for further processing : 351
% 0.40/0.53 # Other redundant clauses eliminated : 6
% 0.40/0.53 # Clauses deleted for lack of memory : 0
% 0.40/0.53 # Backward-subsumed : 0
% 0.40/0.53 # Backward-rewritten : 0
% 0.40/0.53 # Generated clauses : 823
% 0.40/0.53 # ...of the previous two non-redundant : 767
% 0.40/0.53 # ...aggressively subsumed : 0
% 0.40/0.53 # Contextual simplify-reflections : 0
% 0.40/0.53 # Paramodulations : 800
% 0.40/0.53 # Factorizations : 0
% 0.40/0.53 # NegExts : 0
% 0.40/0.53 # Equation resolutions : 20
% 0.40/0.53 # Total rewrite steps : 752
% 0.40/0.53 # Propositional unsat checks : 0
% 0.40/0.53 # Propositional check models : 0
% 0.40/0.53 # Propositional check unsatisfiable : 0
% 0.40/0.53 # Propositional clauses : 0
% 0.40/0.53 # Propositional clauses after purity: 0
% 0.40/0.53 # Propositional unsat core size : 0
% 0.40/0.53 # Propositional preprocessing time : 0.000
% 0.40/0.53 # Propositional encoding time : 0.000
% 0.40/0.53 # Propositional solver time : 0.000
% 0.40/0.53 # Success case prop preproc time : 0.000
% 0.40/0.53 # Success case prop encoding time : 0.000
% 0.40/0.53 # Success case prop solver time : 0.000
% 0.40/0.53 # Current number of processed clauses : 186
% 0.40/0.53 # Positive orientable unit clauses : 51
% 0.40/0.53 # Positive unorientable unit clauses: 0
% 0.40/0.53 # Negative unit clauses : 10
% 0.40/0.53 # Non-unit-clauses : 125
% 0.40/0.53 # Current number of unprocessed clauses: 732
% 0.40/0.53 # ...number of literals in the above : 2742
% 0.40/0.53 # Current number of archived formulas : 0
% 0.40/0.53 # Current number of archived clauses : 164
% 0.40/0.53 # Clause-clause subsumption calls (NU) : 4640
% 0.40/0.53 # Rec. Clause-clause subsumption calls : 1432
% 0.40/0.53 # Non-unit clause-clause subsumptions : 2
% 0.40/0.53 # Unit Clause-clause subsumption calls : 260
% 0.40/0.53 # Rewrite failures with RHS unbound : 0
% 0.40/0.53 # BW rewrite match attempts : 0
% 0.40/0.53 # BW rewrite match successes : 0
% 0.40/0.53 # Condensation attempts : 0
% 0.40/0.53 # Condensation successes : 0
% 0.40/0.53 # Termbank termtop insertions : 22308
% 0.40/0.53
% 0.40/0.53 # -------------------------------------------------
% 0.40/0.53 # User time : 0.026 s
% 0.40/0.53 # System time : 0.005 s
% 0.40/0.53 # Total time : 0.031 s
% 0.40/0.53 # Maximum resident set size: 2208 pages
% 0.40/0.53
% 0.40/0.53 # -------------------------------------------------
% 0.40/0.53 # User time : 0.027 s
% 0.40/0.53 # System time : 0.009 s
% 0.40/0.53 # Total time : 0.035 s
% 0.40/0.53 # Maximum resident set size: 1760 pages
% 0.40/0.53 % E---3.1 exiting
% 0.40/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------