TSTP Solution File: NUM622+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM622+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:40 EDT 2023
% Result : Theorem 34.59s 4.83s
% Output : CNFRefutation 34.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 38 ( 7 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 33 ( 9 ~; 7 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cV2WFeCpK2/E---3.1_5599.p',m__4660) ).
fof(m__5461,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xn))
=> aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
& aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.cV2WFeCpK2/E---3.1_5599.p',m__5461) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,szDzozmdt0(xd))
& sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox/tmp/tmp.cV2WFeCpK2/E---3.1_5599.p',m__5309) ).
fof(m__,conjecture,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/tmp/tmp.cV2WFeCpK2/E---3.1_5599.p',m__) ).
fof(c_0_4,hypothesis,
! [X69,X70] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( aElementOf0(sdtlpdtrp0(xe,X69),sdtlpdtrp0(xN,X69))
| ~ aElementOf0(X69,szNzAzT0) )
& ( ~ aElementOf0(X70,sdtlpdtrp0(xN,X69))
| sdtlseqdt0(sdtlpdtrp0(xe,X69),X70)
| ~ aElementOf0(X69,szNzAzT0) )
& ( sdtlpdtrp0(xe,X69) = szmzizndt0(sdtlpdtrp0(xN,X69))
| ~ aElementOf0(X69,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])]) ).
fof(c_0_5,hypothesis,
! [X87] :
( ( ~ aElementOf0(X87,sdtlpdtrp0(xN,xn))
| aElementOf0(X87,sdtlpdtrp0(xN,xm)) )
& aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5461])])]) ).
cnf(c_0_6,hypothesis,
( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_8,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
inference(split_conjunct,[status(thm)],[m__5309]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xn)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xn)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM622+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 13:48:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.cV2WFeCpK2/E---3.1_5599.p
% 34.59/4.83 # Version: 3.1pre001
% 34.59/4.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 34.59/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.59/4.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 34.59/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.59/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.59/4.83 # Starting sh5l with 300s (1) cores
% 34.59/4.83 # sh5l with pid 5719 completed with status 0
% 34.59/4.83 # Result found by sh5l
% 34.59/4.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 34.59/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.59/4.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 34.59/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.59/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.59/4.83 # Starting sh5l with 300s (1) cores
% 34.59/4.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 34.59/4.83 # Search class: FGHSF-SMLM32-MFFFFFNN
% 34.59/4.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.59/4.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 34.59/4.83 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 5814 completed with status 0
% 34.59/4.83 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 34.59/4.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 34.59/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.59/4.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 34.59/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.59/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.59/4.83 # Starting sh5l with 300s (1) cores
% 34.59/4.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 34.59/4.83 # Search class: FGHSF-SMLM32-MFFFFFNN
% 34.59/4.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.59/4.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 34.59/4.83 # Preprocessing time : 0.098 s
% 34.59/4.83 # Presaturation interreduction done
% 34.59/4.83
% 34.59/4.83 # Proof found!
% 34.59/4.83 # SZS status Theorem
% 34.59/4.83 # SZS output start CNFRefutation
% See solution above
% 34.59/4.83 # Parsed axioms : 119
% 34.59/4.83 # Removed by relevancy pruning/SinE : 2
% 34.59/4.83 # Initial clauses : 4923
% 34.59/4.83 # Removed in clause preprocessing : 7
% 34.59/4.83 # Initial clauses in saturation : 4916
% 34.59/4.83 # Processed clauses : 7054
% 34.59/4.83 # ...of these trivial : 8
% 34.59/4.83 # ...subsumed : 909
% 34.59/4.83 # ...remaining for further processing : 6137
% 34.59/4.83 # Other redundant clauses eliminated : 2036
% 34.59/4.83 # Clauses deleted for lack of memory : 0
% 34.59/4.83 # Backward-subsumed : 12
% 34.59/4.83 # Backward-rewritten : 3
% 34.59/4.83 # Generated clauses : 2266
% 34.59/4.83 # ...of the previous two non-redundant : 2226
% 34.59/4.83 # ...aggressively subsumed : 0
% 34.59/4.83 # Contextual simplify-reflections : 71
% 34.59/4.83 # Paramodulations : 430
% 34.59/4.83 # Factorizations : 0
% 34.59/4.83 # NegExts : 0
% 34.59/4.83 # Equation resolutions : 2036
% 34.59/4.83 # Total rewrite steps : 237
% 34.59/4.83 # Propositional unsat checks : 0
% 34.59/4.83 # Propositional check models : 0
% 34.59/4.83 # Propositional check unsatisfiable : 0
% 34.59/4.83 # Propositional clauses : 0
% 34.59/4.83 # Propositional clauses after purity: 0
% 34.59/4.83 # Propositional unsat core size : 0
% 34.59/4.83 # Propositional preprocessing time : 0.000
% 34.59/4.83 # Propositional encoding time : 0.000
% 34.59/4.83 # Propositional solver time : 0.000
% 34.59/4.83 # Success case prop preproc time : 0.000
% 34.59/4.83 # Success case prop encoding time : 0.000
% 34.59/4.83 # Success case prop solver time : 0.000
% 34.59/4.83 # Current number of processed clauses : 280
% 34.59/4.83 # Positive orientable unit clauses : 173
% 34.59/4.83 # Positive unorientable unit clauses: 0
% 34.59/4.83 # Negative unit clauses : 28
% 34.59/4.83 # Non-unit-clauses : 79
% 34.59/4.83 # Current number of unprocessed clauses: 4094
% 34.59/4.83 # ...number of literals in the above : 44412
% 34.59/4.83 # Current number of archived formulas : 0
% 34.59/4.83 # Current number of archived clauses : 4021
% 34.59/4.83 # Clause-clause subsumption calls (NU) : 7571808
% 34.59/4.83 # Rec. Clause-clause subsumption calls : 74402
% 34.59/4.83 # Non-unit clause-clause subsumptions : 980
% 34.59/4.83 # Unit Clause-clause subsumption calls : 1784
% 34.59/4.83 # Rewrite failures with RHS unbound : 0
% 34.59/4.83 # BW rewrite match attempts : 3
% 34.59/4.83 # BW rewrite match successes : 3
% 34.59/4.83 # Condensation attempts : 0
% 34.59/4.83 # Condensation successes : 0
% 34.59/4.83 # Termbank termtop insertions : 667113
% 34.59/4.83
% 34.59/4.83 # -------------------------------------------------
% 34.59/4.83 # User time : 4.303 s
% 34.59/4.83 # System time : 0.039 s
% 34.59/4.83 # Total time : 4.342 s
% 34.59/4.83 # Maximum resident set size: 14460 pages
% 34.59/4.83
% 34.59/4.83 # -------------------------------------------------
% 34.59/4.83 # User time : 4.310 s
% 34.59/4.83 # System time : 0.040 s
% 34.59/4.83 # Total time : 4.350 s
% 34.59/4.83 # Maximum resident set size: 1876 pages
% 34.59/4.83 % E---3.1 exiting
% 34.59/4.84 % E---3.1 exiting
%------------------------------------------------------------------------------