TSTP Solution File: NUM615+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM615+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 18:56:38 EDT 2023
% Result : Theorem 35.32s 5.14s
% Output : CNFRefutation 35.32s
% 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/sandbox/tmp/tmp.tHWkO1i9CU/E---3.1_32041.p',m__) ).
fof(m__5182,hypothesis,
? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xp ),
file('/export/starexec/sandbox/tmp/tmp.tHWkO1i9CU/E---3.1_32041.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,
! [X8] :
( ( ~ aElementOf0(X8,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X8) != szDzizrdt0(xd)
| sdtlpdtrp0(xe,X8) != xp )
& ( ~ aElementOf0(X8,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X8) != xp ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,hypothesis,
( aElementOf0(esk1_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk1_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,esk1_0) = xp,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElementOf0(esk1_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.11/0.14 % Problem : NUM615+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 14:16:53 EDT 2023
% 0.14/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.tHWkO1i9CU/E---3.1_32041.p
% 35.32/5.14 # Version: 3.1pre001
% 35.32/5.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.32/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.32/5.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.32/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.32/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.32/5.14 # Starting sh5l with 300s (1) cores
% 35.32/5.14 # sh5l with pid 32128 completed with status 0
% 35.32/5.14 # Result found by sh5l
% 35.32/5.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.32/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.32/5.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.32/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.32/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.32/5.14 # Starting sh5l with 300s (1) cores
% 35.32/5.14 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.32/5.14 # Search class: FGHSF-SMLM32-MFFFFFNN
% 35.32/5.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.32/5.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 35.32/5.14 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 32129 completed with status 0
% 35.32/5.14 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 35.32/5.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.32/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.32/5.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.32/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.32/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.32/5.14 # Starting sh5l with 300s (1) cores
% 35.32/5.14 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.32/5.14 # Search class: FGHSF-SMLM32-MFFFFFNN
% 35.32/5.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.32/5.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 35.32/5.14 # Preprocessing time : 0.104 s
% 35.32/5.14 # Presaturation interreduction done
% 35.32/5.14
% 35.32/5.14 # Proof found!
% 35.32/5.14 # SZS status Theorem
% 35.32/5.14 # SZS output start CNFRefutation
% See solution above
% 35.32/5.14 # Parsed axioms : 111
% 35.32/5.14 # Removed by relevancy pruning/SinE : 2
% 35.32/5.14 # Initial clauses : 4903
% 35.32/5.14 # Removed in clause preprocessing : 7
% 35.32/5.14 # Initial clauses in saturation : 4896
% 35.32/5.14 # Processed clauses : 6757
% 35.32/5.14 # ...of these trivial : 4
% 35.32/5.14 # ...subsumed : 890
% 35.32/5.14 # ...remaining for further processing : 5863
% 35.32/5.14 # Other redundant clauses eliminated : 2036
% 35.32/5.14 # Clauses deleted for lack of memory : 0
% 35.32/5.14 # Backward-subsumed : 14
% 35.32/5.14 # Backward-rewritten : 1
% 35.32/5.14 # Generated clauses : 1837
% 35.32/5.14 # ...of the previous two non-redundant : 1837
% 35.32/5.14 # ...aggressively subsumed : 0
% 35.32/5.14 # Contextual simplify-reflections : 69
% 35.32/5.14 # Paramodulations : 1
% 35.32/5.14 # Factorizations : 0
% 35.32/5.14 # NegExts : 0
% 35.32/5.14 # Equation resolutions : 2036
% 35.32/5.14 # Total rewrite steps : 35
% 35.32/5.14 # Propositional unsat checks : 0
% 35.32/5.14 # Propositional check models : 0
% 35.32/5.14 # Propositional check unsatisfiable : 0
% 35.32/5.14 # Propositional clauses : 0
% 35.32/5.14 # Propositional clauses after purity: 0
% 35.32/5.14 # Propositional unsat core size : 0
% 35.32/5.14 # Propositional preprocessing time : 0.000
% 35.32/5.14 # Propositional encoding time : 0.000
% 35.32/5.14 # Propositional solver time : 0.000
% 35.32/5.14 # Success case prop preproc time : 0.000
% 35.32/5.14 # Success case prop encoding time : 0.000
% 35.32/5.14 # Success case prop solver time : 0.000
% 35.32/5.14 # Current number of processed clauses : 24
% 35.32/5.14 # Positive orientable unit clauses : 17
% 35.32/5.14 # Positive unorientable unit clauses: 0
% 35.32/5.14 # Negative unit clauses : 5
% 35.32/5.14 # Non-unit-clauses : 2
% 35.32/5.14 # Current number of unprocessed clauses: 3964
% 35.32/5.14 # ...number of literals in the above : 44218
% 35.32/5.14 # Current number of archived formulas : 0
% 35.32/5.14 # Current number of archived clauses : 4003
% 35.32/5.14 # Clause-clause subsumption calls (NU) : 8534595
% 35.32/5.14 # Rec. Clause-clause subsumption calls : 72346
% 35.32/5.14 # Non-unit clause-clause subsumptions : 972
% 35.32/5.14 # Unit Clause-clause subsumption calls : 102
% 35.32/5.14 # Rewrite failures with RHS unbound : 0
% 35.32/5.14 # BW rewrite match attempts : 1
% 35.32/5.14 # BW rewrite match successes : 1
% 35.32/5.14 # Condensation attempts : 0
% 35.32/5.14 # Condensation successes : 0
% 35.32/5.14 # Termbank termtop insertions : 662527
% 35.32/5.14
% 35.32/5.14 # -------------------------------------------------
% 35.32/5.14 # User time : 4.574 s
% 35.32/5.14 # System time : 0.030 s
% 35.32/5.14 # Total time : 4.604 s
% 35.32/5.14 # Maximum resident set size: 14388 pages
% 35.32/5.14
% 35.32/5.14 # -------------------------------------------------
% 35.32/5.14 # User time : 4.582 s
% 35.32/5.14 # System time : 0.031 s
% 35.32/5.14 # Total time : 4.613 s
% 35.32/5.14 # Maximum resident set size: 1872 pages
% 35.32/5.14 % E---3.1 exiting
% 35.32/5.14 % E---3.1 exiting
%------------------------------------------------------------------------------