TSTP Solution File: NUM604+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM604+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 19:07:55 EDT 2023
% Result : Theorem 29.62s 4.33s
% Output : CNFRefutation 29.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 35 ( 6 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 30 ( 9 ~; 7 |; 11 &)
% ( 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 : 9 ( 9 usr; 6 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/sandbox2/tmp/tmp.sJaL8VqA0d/E---3.1_2088.p',m__4660) ).
fof(m__5045,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox2/tmp/tmp.sJaL8VqA0d/E---3.1_2088.p',m__5045) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox2/tmp/tmp.sJaL8VqA0d/E---3.1_2088.p',m__5034) ).
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/tmp/tmp.sJaL8VqA0d/E---3.1_2088.p',m__) ).
fof(c_0_4,hypothesis,
! [X65,X66] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( aElementOf0(sdtlpdtrp0(xe,X65),sdtlpdtrp0(xN,X65))
| ~ aElementOf0(X65,szNzAzT0) )
& ( ~ aElementOf0(X66,sdtlpdtrp0(xN,X65))
| sdtlseqdt0(sdtlpdtrp0(xe,X65),X66)
| ~ aElementOf0(X65,szNzAzT0) )
& ( sdtlpdtrp0(xe,X65) = szmzizndt0(sdtlpdtrp0(xN,X65))
| ~ aElementOf0(X65,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,
! [X85] :
( ( ~ aElementOf0(X85,sdtlpdtrp0(xN,xi))
| aElementOf0(X85,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5045])])]) ).
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(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_8,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[m__5034]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xx,sdtlpdtrp0(xN,xi)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(xx,xS),
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.07/0.12 % Problem : NUM604+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 14:51:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.sJaL8VqA0d/E---3.1_2088.p
% 29.62/4.33 # Version: 3.1pre001
% 29.62/4.33 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.62/4.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.62/4.33 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.62/4.33 # Starting new_bool_3 with 300s (1) cores
% 29.62/4.33 # Starting new_bool_1 with 300s (1) cores
% 29.62/4.33 # Starting sh5l with 300s (1) cores
% 29.62/4.33 # new_bool_1 with pid 2234 completed with status 0
% 29.62/4.33 # Result found by new_bool_1
% 29.62/4.33 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.62/4.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.62/4.33 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.62/4.33 # Starting new_bool_3 with 300s (1) cores
% 29.62/4.33 # Starting new_bool_1 with 300s (1) cores
% 29.62/4.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.62/4.33 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.62/4.33 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.62/4.33 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 29.62/4.33 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 2313 completed with status 0
% 29.62/4.33 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 29.62/4.33 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.62/4.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.62/4.33 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.62/4.33 # Starting new_bool_3 with 300s (1) cores
% 29.62/4.33 # Starting new_bool_1 with 300s (1) cores
% 29.62/4.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.62/4.33 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.62/4.33 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.62/4.33 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 29.62/4.33 # Preprocessing time : 0.107 s
% 29.62/4.33 # Presaturation interreduction done
% 29.62/4.33
% 29.62/4.33 # Proof found!
% 29.62/4.33 # SZS status Theorem
% 29.62/4.33 # SZS output start CNFRefutation
% See solution above
% 29.62/4.33 # Parsed axioms : 101
% 29.62/4.33 # Removed by relevancy pruning/SinE : 2
% 29.62/4.33 # Initial clauses : 4873
% 29.62/4.33 # Removed in clause preprocessing : 7
% 29.62/4.33 # Initial clauses in saturation : 4866
% 29.62/4.33 # Processed clauses : 7229
% 29.62/4.33 # ...of these trivial : 5
% 29.62/4.33 # ...subsumed : 953
% 29.62/4.33 # ...remaining for further processing : 6271
% 29.62/4.33 # Other redundant clauses eliminated : 2035
% 29.62/4.33 # Clauses deleted for lack of memory : 0
% 29.62/4.33 # Backward-subsumed : 17
% 29.62/4.33 # Backward-rewritten : 28
% 29.62/4.33 # Generated clauses : 2901
% 29.62/4.33 # ...of the previous two non-redundant : 2871
% 29.62/4.33 # ...aggressively subsumed : 0
% 29.62/4.33 # Contextual simplify-reflections : 77
% 29.62/4.33 # Paramodulations : 1065
% 29.62/4.33 # Factorizations : 0
% 29.62/4.33 # NegExts : 0
% 29.62/4.33 # Equation resolutions : 2036
% 29.62/4.33 # Total rewrite steps : 468
% 29.62/4.33 # Propositional unsat checks : 0
% 29.62/4.33 # Propositional check models : 0
% 29.62/4.33 # Propositional check unsatisfiable : 0
% 29.62/4.33 # Propositional clauses : 0
% 29.62/4.33 # Propositional clauses after purity: 0
% 29.62/4.33 # Propositional unsat core size : 0
% 29.62/4.33 # Propositional preprocessing time : 0.000
% 29.62/4.33 # Propositional encoding time : 0.000
% 29.62/4.33 # Propositional solver time : 0.000
% 29.62/4.33 # Success case prop preproc time : 0.000
% 29.62/4.33 # Success case prop encoding time : 0.000
% 29.62/4.33 # Success case prop solver time : 0.000
% 29.62/4.33 # Current number of processed clauses : 427
% 29.62/4.33 # Positive orientable unit clauses : 186
% 29.62/4.33 # Positive unorientable unit clauses: 0
% 29.62/4.33 # Negative unit clauses : 31
% 29.62/4.33 # Non-unit-clauses : 210
% 29.62/4.33 # Current number of unprocessed clauses: 4454
% 29.62/4.33 # ...number of literals in the above : 45479
% 29.62/4.33 # Current number of archived formulas : 0
% 29.62/4.33 # Current number of archived clauses : 4009
% 29.62/4.33 # Clause-clause subsumption calls (NU) : 6994338
% 29.62/4.33 # Rec. Clause-clause subsumption calls : 75613
% 29.62/4.33 # Non-unit clause-clause subsumptions : 1020
% 29.62/4.33 # Unit Clause-clause subsumption calls : 3502
% 29.62/4.33 # Rewrite failures with RHS unbound : 0
% 29.62/4.33 # BW rewrite match attempts : 21
% 29.62/4.33 # BW rewrite match successes : 9
% 29.62/4.33 # Condensation attempts : 0
% 29.62/4.33 # Condensation successes : 0
% 29.62/4.33 # Termbank termtop insertions : 673915
% 29.62/4.33
% 29.62/4.33 # -------------------------------------------------
% 29.62/4.33 # User time : 3.739 s
% 29.62/4.33 # System time : 0.031 s
% 29.62/4.33 # Total time : 3.770 s
% 29.62/4.33 # Maximum resident set size: 14120 pages
% 29.62/4.33
% 29.62/4.33 # -------------------------------------------------
% 29.62/4.33 # User time : 3.745 s
% 29.62/4.33 # System time : 0.033 s
% 29.62/4.33 # Total time : 3.779 s
% 29.62/4.33 # Maximum resident set size: 1856 pages
% 29.62/4.33 % E---3.1 exiting
%------------------------------------------------------------------------------