TSTP Solution File: NUM615+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM615+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:15:01 EDT 2024
% Result : Theorem 53.52s 7.29s
% Output : CNFRefutation 53.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 22 ( 11 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 21 ( 8 ~; 6 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn 1 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( ( aElementOf0(X1,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) )
| aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& sdtlpdtrp0(xe,X1) = xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__5182,hypothesis,
? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5182) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( ( ( aElementOf0(X1,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) )
| aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& sdtlpdtrp0(xe,X1) = xp ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X267] :
( ( ~ aElementOf0(X267,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X267) != szDzizrdt0(xd)
| sdtlpdtrp0(xe,X267) != xp )
& ( ~ aElementOf0(X267,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X267) != xp ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,hypothesis,
( aElementOf0(esk41_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk41_0) = xp ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5182])]) ).
cnf(c_0_5,negated_conjecture,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X1) != xp ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtlpdtrp0(xe,esk41_0) = xp,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElementOf0(esk41_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM615+3 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 05:32:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/benchmark/theBenchmark.p
% 53.52/7.29 # Version: 3.1.0
% 53.52/7.29 # Preprocessing class: FSLSSMSMSSSNFFN.
% 53.52/7.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.52/7.29 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 53.52/7.29 # Starting new_bool_3 with 300s (1) cores
% 53.52/7.29 # Starting new_bool_1 with 300s (1) cores
% 53.52/7.29 # Starting sh5l with 300s (1) cores
% 53.52/7.29 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 21273 completed with status 0
% 53.52/7.29 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 53.52/7.29 # Preprocessing class: FSLSSMSMSSSNFFN.
% 53.52/7.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.52/7.29 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 53.52/7.29 # No SInE strategy applied
% 53.52/7.29 # Search class: FGHSF-SMLM32-MFFFFFNN
% 53.52/7.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.52/7.29 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 53.52/7.29 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 53.52/7.29 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 53.52/7.29 # Starting new_bool_3 with 136s (1) cores
% 53.52/7.29 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 53.52/7.29 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 21280 completed with status 0
% 53.52/7.29 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 53.52/7.29 # Preprocessing class: FSLSSMSMSSSNFFN.
% 53.52/7.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.52/7.29 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 53.52/7.29 # No SInE strategy applied
% 53.52/7.29 # Search class: FGHSF-SMLM32-MFFFFFNN
% 53.52/7.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.52/7.29 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 53.52/7.29 # Preprocessing time : 0.163 s
% 53.52/7.29 # Presaturation interreduction done
% 53.52/7.29
% 53.52/7.29 # Proof found!
% 53.52/7.29 # SZS status Theorem
% 53.52/7.29 # SZS output start CNFRefutation
% See solution above
% 53.52/7.29 # Parsed axioms : 111
% 53.52/7.29 # Removed by relevancy pruning/SinE : 0
% 53.52/7.29 # Initial clauses : 4912
% 53.52/7.29 # Removed in clause preprocessing : 7
% 53.52/7.29 # Initial clauses in saturation : 4905
% 53.52/7.29 # Processed clauses : 6779
% 53.52/7.29 # ...of these trivial : 4
% 53.52/7.29 # ...subsumed : 891
% 53.52/7.29 # ...remaining for further processing : 5884
% 53.52/7.29 # Other redundant clauses eliminated : 2043
% 53.52/7.29 # Clauses deleted for lack of memory : 0
% 53.52/7.29 # Backward-subsumed : 14
% 53.52/7.29 # Backward-rewritten : 1
% 53.52/7.29 # Generated clauses : 1846
% 53.52/7.29 # ...of the previous two non-redundant : 1846
% 53.52/7.29 # ...aggressively subsumed : 0
% 53.52/7.29 # Contextual simplify-reflections : 69
% 53.52/7.29 # Paramodulations : 3
% 53.52/7.29 # Factorizations : 0
% 53.52/7.29 # NegExts : 0
% 53.52/7.29 # Equation resolutions : 2043
% 53.52/7.29 # Disequality decompositions : 0
% 53.52/7.29 # Total rewrite steps : 37
% 53.52/7.29 # ...of those cached : 27
% 53.52/7.29 # Propositional unsat checks : 0
% 53.52/7.29 # Propositional check models : 0
% 53.52/7.29 # Propositional check unsatisfiable : 0
% 53.52/7.29 # Propositional clauses : 0
% 53.52/7.29 # Propositional clauses after purity: 0
% 53.52/7.29 # Propositional unsat core size : 0
% 53.52/7.29 # Propositional preprocessing time : 0.000
% 53.52/7.29 # Propositional encoding time : 0.000
% 53.52/7.29 # Propositional solver time : 0.000
% 53.52/7.29 # Success case prop preproc time : 0.000
% 53.52/7.29 # Success case prop encoding time : 0.000
% 53.52/7.29 # Success case prop solver time : 0.000
% 53.52/7.29 # Current number of processed clauses : 29
% 53.52/7.29 # Positive orientable unit clauses : 21
% 53.52/7.29 # Positive unorientable unit clauses: 0
% 53.52/7.29 # Negative unit clauses : 6
% 53.52/7.29 # Non-unit-clauses : 2
% 53.52/7.29 # Current number of unprocessed clauses: 3969
% 53.52/7.29 # ...number of literals in the above : 44255
% 53.52/7.29 # Current number of archived formulas : 0
% 53.52/7.29 # Current number of archived clauses : 4012
% 53.52/7.29 # Clause-clause subsumption calls (NU) : 8770417
% 53.52/7.29 # Rec. Clause-clause subsumption calls : 74471
% 53.52/7.29 # Non-unit clause-clause subsumptions : 972
% 53.52/7.29 # Unit Clause-clause subsumption calls : 55
% 53.52/7.29 # Rewrite failures with RHS unbound : 0
% 53.52/7.29 # BW rewrite match attempts : 1
% 53.52/7.29 # BW rewrite match successes : 1
% 53.52/7.29 # Condensation attempts : 0
% 53.52/7.29 # Condensation successes : 0
% 53.52/7.29 # Termbank termtop insertions : 667042
% 53.52/7.29 # Search garbage collected termcells : 32045
% 53.52/7.29
% 53.52/7.29 # -------------------------------------------------
% 53.52/7.29 # User time : 6.784 s
% 53.52/7.29 # System time : 0.036 s
% 53.52/7.29 # Total time : 6.820 s
% 53.52/7.29 # Maximum resident set size: 14348 pages
% 53.52/7.29
% 53.52/7.29 # -------------------------------------------------
% 53.52/7.29 # User time : 32.627 s
% 53.52/7.29 # System time : 0.134 s
% 53.52/7.29 # Total time : 32.761 s
% 53.52/7.29 # Maximum resident set size: 1876 pages
% 53.52/7.29 % E---3.1 exiting
% 53.52/7.29 % E exiting
%------------------------------------------------------------------------------