TSTP Solution File: NUM603+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM603+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:27:09 EDT 2024
% Result : Theorem 0.60s 0.54s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 49 ( 18 ~; 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__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',m__3623) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
fof(c_0_6,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_7,hypothesis,
! [X185,X186] :
( ~ aElementOf0(X185,szNzAzT0)
| ~ aElementOf0(X186,szNzAzT0)
| ~ sdtlseqdt0(X186,X185)
| aSubsetOf0(sdtlpdtrp0(xN,X185),sdtlpdtrp0(xN,X186)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])]) ).
fof(c_0_8,hypothesis,
! [X183] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X183)),sdtmndt0(sdtlpdtrp0(xN,X183),szmzizndt0(sdtlpdtrp0(xN,X183))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aElementOf0(X183,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X183)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aElementOf0(X183,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])]) ).
fof(c_0_9,plain,
! [X66] :
( ~ aElementOf0(X66,szNzAzT0)
| sdtlseqdt0(sz00,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])])]) ).
fof(c_0_10,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_14,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,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_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM603+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 04:28:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.54 # Version: 3.1.0
% 0.60/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.60/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.60/0.54 # Starting sh5l with 300s (1) cores
% 0.60/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18417 completed with status 0
% 0.60/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.60/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 # No SInE strategy applied
% 0.60/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.60/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.60/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.60/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.60/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.60/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.60/0.54 # SAT001_MinMin_p005000_rr_RG with pid 18424 completed with status 0
% 0.60/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.60/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 # No SInE strategy applied
% 0.60/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.60/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.60/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.60/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.60/0.54 # Preprocessing time : 0.004 s
% 0.60/0.54 # Presaturation interreduction done
% 0.60/0.54
% 0.60/0.54 # Proof found!
% 0.60/0.54 # SZS status Theorem
% 0.60/0.54 # SZS output start CNFRefutation
% See solution above
% 0.60/0.54 # Parsed axioms : 100
% 0.60/0.54 # Removed by relevancy pruning/SinE : 0
% 0.60/0.54 # Initial clauses : 203
% 0.60/0.54 # Removed in clause preprocessing : 7
% 0.60/0.54 # Initial clauses in saturation : 196
% 0.60/0.54 # Processed clauses : 401
% 0.60/0.54 # ...of these trivial : 1
% 0.60/0.54 # ...subsumed : 12
% 0.60/0.54 # ...remaining for further processing : 388
% 0.60/0.54 # Other redundant clauses eliminated : 49
% 0.60/0.54 # Clauses deleted for lack of memory : 0
% 0.60/0.54 # Backward-subsumed : 2
% 0.60/0.54 # Backward-rewritten : 3
% 0.60/0.54 # Generated clauses : 179
% 0.60/0.54 # ...of the previous two non-redundant : 141
% 0.60/0.54 # ...aggressively subsumed : 0
% 0.60/0.54 # Contextual simplify-reflections : 24
% 0.60/0.54 # Paramodulations : 134
% 0.60/0.54 # Factorizations : 0
% 0.60/0.54 # NegExts : 0
% 0.60/0.54 # Equation resolutions : 50
% 0.60/0.54 # Disequality decompositions : 0
% 0.60/0.54 # Total rewrite steps : 130
% 0.60/0.54 # ...of those cached : 98
% 0.60/0.54 # Propositional unsat checks : 0
% 0.60/0.54 # Propositional check models : 0
% 0.60/0.54 # Propositional check unsatisfiable : 0
% 0.60/0.54 # Propositional clauses : 0
% 0.60/0.54 # Propositional clauses after purity: 0
% 0.60/0.54 # Propositional unsat core size : 0
% 0.60/0.54 # Propositional preprocessing time : 0.000
% 0.60/0.54 # Propositional encoding time : 0.000
% 0.60/0.54 # Propositional solver time : 0.000
% 0.60/0.54 # Success case prop preproc time : 0.000
% 0.60/0.54 # Success case prop encoding time : 0.000
% 0.60/0.54 # Success case prop solver time : 0.000
% 0.60/0.54 # Current number of processed clauses : 149
% 0.60/0.54 # Positive orientable unit clauses : 56
% 0.60/0.54 # Positive unorientable unit clauses: 0
% 0.60/0.54 # Negative unit clauses : 11
% 0.60/0.54 # Non-unit-clauses : 82
% 0.60/0.54 # Current number of unprocessed clauses: 127
% 0.60/0.54 # ...number of literals in the above : 586
% 0.60/0.54 # Current number of archived formulas : 0
% 0.60/0.54 # Current number of archived clauses : 199
% 0.60/0.54 # Clause-clause subsumption calls (NU) : 10890
% 0.60/0.54 # Rec. Clause-clause subsumption calls : 3018
% 0.60/0.54 # Non-unit clause-clause subsumptions : 29
% 0.60/0.54 # Unit Clause-clause subsumption calls : 285
% 0.60/0.54 # Rewrite failures with RHS unbound : 0
% 0.60/0.54 # BW rewrite match attempts : 3
% 0.60/0.54 # BW rewrite match successes : 3
% 0.60/0.54 # Condensation attempts : 0
% 0.60/0.54 # Condensation successes : 0
% 0.60/0.54 # Termbank termtop insertions : 20318
% 0.60/0.54 # Search garbage collected termcells : 3730
% 0.60/0.54
% 0.60/0.54 # -------------------------------------------------
% 0.60/0.54 # User time : 0.040 s
% 0.60/0.54 # System time : 0.005 s
% 0.60/0.54 # Total time : 0.045 s
% 0.60/0.54 # Maximum resident set size: 2440 pages
% 0.60/0.54
% 0.60/0.54 # -------------------------------------------------
% 0.60/0.54 # User time : 0.188 s
% 0.60/0.54 # System time : 0.016 s
% 0.60/0.54 # Total time : 0.204 s
% 0.60/0.54 # Maximum resident set size: 1820 pages
% 0.60/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------