TSTP Solution File: NUM630+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM630+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Sat May 4 09:07:06 EDT 2024
% Result : Theorem 0.16s 0.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 41 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 37 ( 13 ~; 10 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__) ).
fof(m__4151,hypothesis,
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aFunction0(sdtlpdtrp0(xC,X1))
& szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__4151) ).
fof(m__5585,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__5585) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__5309) ).
fof(m__5599,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__5599) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p',m__5164) ).
fof(c_0_6,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_7,hypothesis,
! [X191,X192] :
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ( aFunction0(sdtlpdtrp0(xC,X191))
| ~ aElementOf0(X191,szNzAzT0) )
& ( szDzozmdt0(sdtlpdtrp0(xC,X191)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk)
| ~ aElementOf0(X191,szNzAzT0) )
& ( ~ aSet0(X192)
| ~ aElementOf0(X192,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,X191),X192) = sdtlpdtrp0(xc,sdtpldt0(X192,szmzizndt0(sdtlpdtrp0(xN,X191))))
| ~ aElementOf0(X191,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__4151])])])])]) ).
fof(c_0_8,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[m__5585]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_12,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[m__5599]) ).
cnf(c_0_15,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM630+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n031.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 09:57:16 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ImVzg0H2mq/E---3.1_12581.p
% 0.16/0.55 # Version: 3.1.0
% 0.16/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 # Starting sh5l with 300s (1) cores
% 0.16/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12659 completed with status 0
% 0.16/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 # No SInE strategy applied
% 0.16/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.16/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.16/0.55 # SAT001_MinMin_p005000_rr_RG with pid 12666 completed with status 0
% 0.16/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 # No SInE strategy applied
% 0.16/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/0.55 # Preprocessing time : 0.003 s
% 0.16/0.55 # Presaturation interreduction done
% 0.16/0.55
% 0.16/0.55 # Proof found!
% 0.16/0.55 # SZS status Theorem
% 0.16/0.55 # SZS output start CNFRefutation
% See solution above
% 0.16/0.55 # Parsed axioms : 116
% 0.16/0.55 # Removed by relevancy pruning/SinE : 0
% 0.16/0.55 # Initial clauses : 222
% 0.16/0.55 # Removed in clause preprocessing : 7
% 0.16/0.55 # Initial clauses in saturation : 215
% 0.16/0.55 # Processed clauses : 1270
% 0.16/0.55 # ...of these trivial : 13
% 0.16/0.55 # ...subsumed : 361
% 0.16/0.55 # ...remaining for further processing : 896
% 0.16/0.55 # Other redundant clauses eliminated : 54
% 0.16/0.55 # Clauses deleted for lack of memory : 0
% 0.16/0.55 # Backward-subsumed : 45
% 0.16/0.55 # Backward-rewritten : 21
% 0.16/0.55 # Generated clauses : 2362
% 0.16/0.55 # ...of the previous two non-redundant : 2080
% 0.16/0.55 # ...aggressively subsumed : 0
% 0.16/0.55 # Contextual simplify-reflections : 41
% 0.16/0.55 # Paramodulations : 2309
% 0.16/0.55 # Factorizations : 0
% 0.16/0.55 # NegExts : 0
% 0.16/0.55 # Equation resolutions : 58
% 0.16/0.55 # Disequality decompositions : 0
% 0.16/0.55 # Total rewrite steps : 1859
% 0.16/0.55 # ...of those cached : 1761
% 0.16/0.55 # Propositional unsat checks : 0
% 0.16/0.55 # Propositional check models : 0
% 0.16/0.55 # Propositional check unsatisfiable : 0
% 0.16/0.55 # Propositional clauses : 0
% 0.16/0.55 # Propositional clauses after purity: 0
% 0.16/0.55 # Propositional unsat core size : 0
% 0.16/0.55 # Propositional preprocessing time : 0.000
% 0.16/0.55 # Propositional encoding time : 0.000
% 0.16/0.55 # Propositional solver time : 0.000
% 0.16/0.55 # Success case prop preproc time : 0.000
% 0.16/0.55 # Success case prop encoding time : 0.000
% 0.16/0.55 # Success case prop solver time : 0.000
% 0.16/0.55 # Current number of processed clauses : 577
% 0.16/0.55 # Positive orientable unit clauses : 116
% 0.16/0.55 # Positive unorientable unit clauses: 0
% 0.16/0.55 # Negative unit clauses : 39
% 0.16/0.55 # Non-unit-clauses : 422
% 0.16/0.55 # Current number of unprocessed clauses: 1206
% 0.16/0.55 # ...number of literals in the above : 6342
% 0.16/0.55 # Current number of archived formulas : 0
% 0.16/0.55 # Current number of archived clauses : 279
% 0.16/0.55 # Clause-clause subsumption calls (NU) : 24711
% 0.16/0.55 # Rec. Clause-clause subsumption calls : 9117
% 0.16/0.55 # Non-unit clause-clause subsumptions : 211
% 0.16/0.55 # Unit Clause-clause subsumption calls : 2671
% 0.16/0.55 # Rewrite failures with RHS unbound : 0
% 0.16/0.55 # BW rewrite match attempts : 18
% 0.16/0.55 # BW rewrite match successes : 18
% 0.16/0.55 # Condensation attempts : 0
% 0.16/0.55 # Condensation successes : 0
% 0.16/0.55 # Termbank termtop insertions : 56460
% 0.16/0.55 # Search garbage collected termcells : 3744
% 0.16/0.55
% 0.16/0.55 # -------------------------------------------------
% 0.16/0.55 # User time : 0.090 s
% 0.16/0.55 # System time : 0.007 s
% 0.16/0.55 # Total time : 0.097 s
% 0.16/0.55 # Maximum resident set size: 2472 pages
% 0.16/0.55
% 0.16/0.55 # -------------------------------------------------
% 0.16/0.55 # User time : 0.413 s
% 0.16/0.55 # System time : 0.029 s
% 0.16/0.55 # Total time : 0.442 s
% 0.16/0.55 # Maximum resident set size: 1836 pages
% 0.16/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------