TSTP Solution File: NUM603+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:34 EDT 2023
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 49 ( 6 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 48 ( 17 ~; 15 |; 11 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',m__3754) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',m__3623) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',mZeroLess) ).
fof(m__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',m__) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',mZeroNum) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox2/tmp/tmp.vi349qMGfm/E---3.1_24400.p',m__5034) ).
fof(c_0_6,hypothesis,
! [X176,X177] :
( ~ aElementOf0(X176,szNzAzT0)
| ~ aElementOf0(X177,szNzAzT0)
| ~ sdtlseqdt0(X177,X176)
| aSubsetOf0(sdtlpdtrp0(xN,X176),sdtlpdtrp0(xN,X177)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])]) ).
fof(c_0_7,hypothesis,
! [X174] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X174)),sdtmndt0(sdtlpdtrp0(xN,X174),szmzizndt0(sdtlpdtrp0(xN,X174))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X174)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])]) ).
fof(c_0_8,plain,
! [X60] :
( ~ aElementOf0(X60,szNzAzT0)
| sdtlseqdt0(sz00,X60) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).
fof(c_0_9,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_13,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n015.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 13:54:31 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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/tmp/tmp.vi349qMGfm/E---3.1_24400.p
% 0.23/0.57 # Version: 3.1pre001
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 # Starting sh5l with 300s (1) cores
% 0.23/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 24478 completed with status 0
% 0.23/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # No SInE strategy applied
% 0.23/0.57 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.23/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.23/0.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.23/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.23/0.57 # SAT001_MinMin_p005000_rr_RG with pid 24484 completed with status 0
% 0.23/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # No SInE strategy applied
% 0.23/0.57 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.23/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.23/0.57 # Preprocessing time : 0.004 s
% 0.23/0.57 # Presaturation interreduction done
% 0.23/0.57
% 0.23/0.57 # Proof found!
% 0.23/0.57 # SZS status Theorem
% 0.23/0.57 # SZS output start CNFRefutation
% See solution above
% 0.23/0.57 # Parsed axioms : 100
% 0.23/0.57 # Removed by relevancy pruning/SinE : 0
% 0.23/0.57 # Initial clauses : 203
% 0.23/0.57 # Removed in clause preprocessing : 7
% 0.23/0.57 # Initial clauses in saturation : 196
% 0.23/0.57 # Processed clauses : 401
% 0.23/0.57 # ...of these trivial : 1
% 0.23/0.57 # ...subsumed : 12
% 0.23/0.57 # ...remaining for further processing : 388
% 0.23/0.57 # Other redundant clauses eliminated : 49
% 0.23/0.57 # Clauses deleted for lack of memory : 0
% 0.23/0.57 # Backward-subsumed : 2
% 0.23/0.57 # Backward-rewritten : 3
% 0.23/0.57 # Generated clauses : 179
% 0.23/0.57 # ...of the previous two non-redundant : 141
% 0.23/0.57 # ...aggressively subsumed : 0
% 0.23/0.57 # Contextual simplify-reflections : 24
% 0.23/0.57 # Paramodulations : 134
% 0.23/0.57 # Factorizations : 0
% 0.23/0.57 # NegExts : 0
% 0.23/0.57 # Equation resolutions : 50
% 0.23/0.57 # Total rewrite steps : 130
% 0.23/0.57 # Propositional unsat checks : 0
% 0.23/0.57 # Propositional check models : 0
% 0.23/0.57 # Propositional check unsatisfiable : 0
% 0.23/0.57 # Propositional clauses : 0
% 0.23/0.57 # Propositional clauses after purity: 0
% 0.23/0.57 # Propositional unsat core size : 0
% 0.23/0.57 # Propositional preprocessing time : 0.000
% 0.23/0.57 # Propositional encoding time : 0.000
% 0.23/0.57 # Propositional solver time : 0.000
% 0.23/0.57 # Success case prop preproc time : 0.000
% 0.23/0.57 # Success case prop encoding time : 0.000
% 0.23/0.57 # Success case prop solver time : 0.000
% 0.23/0.57 # Current number of processed clauses : 149
% 0.23/0.57 # Positive orientable unit clauses : 56
% 0.23/0.57 # Positive unorientable unit clauses: 0
% 0.23/0.57 # Negative unit clauses : 11
% 0.23/0.57 # Non-unit-clauses : 82
% 0.23/0.57 # Current number of unprocessed clauses: 127
% 0.23/0.57 # ...number of literals in the above : 586
% 0.23/0.57 # Current number of archived formulas : 0
% 0.23/0.57 # Current number of archived clauses : 199
% 0.23/0.57 # Clause-clause subsumption calls (NU) : 10890
% 0.23/0.57 # Rec. Clause-clause subsumption calls : 3018
% 0.23/0.57 # Non-unit clause-clause subsumptions : 29
% 0.23/0.57 # Unit Clause-clause subsumption calls : 285
% 0.23/0.57 # Rewrite failures with RHS unbound : 0
% 0.23/0.57 # BW rewrite match attempts : 3
% 0.23/0.57 # BW rewrite match successes : 3
% 0.23/0.57 # Condensation attempts : 0
% 0.23/0.57 # Condensation successes : 0
% 0.23/0.57 # Termbank termtop insertions : 18042
% 0.23/0.57
% 0.23/0.57 # -------------------------------------------------
% 0.23/0.57 # User time : 0.038 s
% 0.23/0.57 # System time : 0.007 s
% 0.23/0.57 # Total time : 0.045 s
% 0.23/0.57 # Maximum resident set size: 2448 pages
% 0.23/0.57
% 0.23/0.57 # -------------------------------------------------
% 0.23/0.57 # User time : 0.128 s
% 0.23/0.57 # System time : 0.024 s
% 0.23/0.57 # Total time : 0.152 s
% 0.23/0.57 # Maximum resident set size: 1812 pages
% 0.23/0.57 % E---3.1 exiting
% 0.23/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------