TSTP Solution File: NUM624+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM624+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:04 EDT 2024
% Result : Theorem 54.51s 7.55s
% Output : CNFRefutation 54.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 71 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 61 ( 20 ~; 14 |; 22 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 10 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5348,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xP) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5348) ).
fof(m__5401,hypothesis,
! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> sdtlseqdt0(xx,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5401) ).
fof(m__5147,hypothesis,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& xp = szmzizndt0(xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5147) ).
fof(m__5106,hypothesis,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xQ,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5106) ).
fof(m__,conjecture,
xp = xx,
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',mLessASymm) ).
fof(m__5481,hypothesis,
( aElementOf0(xp,sdtlpdtrp0(xN,xm))
& aElementOf0(xx,xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5481) ).
fof(m__5365,hypothesis,
( aElementOf0(xx,szNzAzT0)
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xx ) ),
file('/export/starexec/sandbox2/tmp/tmp.DfLSg3s7ev/E---3.1_15485.p',m__5365) ).
fof(c_0_8,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xP) ),
inference(fof_simplification,[status(thm)],[m__5348]) ).
fof(c_0_9,hypothesis,
! [X268] :
( ~ aElementOf0(X268,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X268) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5401])])]) ).
fof(c_0_10,hypothesis,
! [X261] :
( aElementOf0(xp,xQ)
& ( ~ aElementOf0(X261,xQ)
| sdtlseqdt0(xp,X261) )
& xp = szmzizndt0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])])]) ).
fof(c_0_11,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xP) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_12,hypothesis,
! [X258] :
( ( ~ aElementOf0(X258,xQ)
| aElementOf0(X258,szNzAzT0) )
& aSubsetOf0(xQ,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5106])])])]) ).
fof(c_0_13,negated_conjecture,
xp != xx,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_14,plain,
! [X73,X74] :
( ~ aElementOf0(X73,szNzAzT0)
| ~ aElementOf0(X74,szNzAzT0)
| ~ sdtlseqdt0(X73,X74)
| ~ sdtlseqdt0(X74,X73)
| X73 = X74 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_15,hypothesis,
( sdtlseqdt0(xx,X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5481]) ).
cnf(c_0_17,hypothesis,
( sdtlseqdt0(xp,X1)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(esk42_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk42_0) = xx ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5365])]) ).
cnf(c_0_20,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,negated_conjecture,
xp != xx,
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(xx,xp),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,hypothesis,
sdtlseqdt0(xp,xx),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xp,szNzAzT0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
xp != xx,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM624+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:45:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.DfLSg3s7ev/E---3.1_15485.p
% 54.51/7.55 # Version: 3.1.0
% 54.51/7.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.51/7.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.51/7.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.51/7.55 # Starting new_bool_3 with 300s (1) cores
% 54.51/7.55 # Starting new_bool_1 with 300s (1) cores
% 54.51/7.55 # Starting sh5l with 300s (1) cores
% 54.51/7.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15643 completed with status 0
% 54.51/7.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 54.51/7.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.51/7.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.51/7.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.51/7.55 # No SInE strategy applied
% 54.51/7.55 # Search class: FGHSF-SMLM32-MFFFFFNN
% 54.51/7.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 54.51/7.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 54.51/7.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 54.51/7.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 54.51/7.55 # Starting new_bool_3 with 136s (1) cores
% 54.51/7.55 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 54.51/7.55 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 15649 completed with status 0
% 54.51/7.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 54.51/7.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.51/7.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.51/7.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.51/7.55 # No SInE strategy applied
% 54.51/7.55 # Search class: FGHSF-SMLM32-MFFFFFNN
% 54.51/7.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 54.51/7.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 54.51/7.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 54.51/7.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 54.51/7.55 # Preprocessing time : 0.149 s
% 54.51/7.55 # Presaturation interreduction done
% 54.51/7.55
% 54.51/7.55 # Proof found!
% 54.51/7.55 # SZS status Theorem
% 54.51/7.55 # SZS output start CNFRefutation
% See solution above
% 54.51/7.55 # Parsed axioms : 121
% 54.51/7.55 # Removed by relevancy pruning/SinE : 0
% 54.51/7.55 # Initial clauses : 4938
% 54.51/7.55 # Removed in clause preprocessing : 7
% 54.51/7.55 # Initial clauses in saturation : 4931
% 54.51/7.55 # Processed clauses : 7271
% 54.51/7.55 # ...of these trivial : 11
% 54.51/7.55 # ...subsumed : 904
% 54.51/7.55 # ...remaining for further processing : 6356
% 54.51/7.55 # Other redundant clauses eliminated : 2043
% 54.51/7.55 # Clauses deleted for lack of memory : 0
% 54.51/7.55 # Backward-subsumed : 16
% 54.51/7.55 # Backward-rewritten : 9
% 54.51/7.55 # Generated clauses : 2812
% 54.51/7.55 # ...of the previous two non-redundant : 2675
% 54.51/7.55 # ...aggressively subsumed : 0
% 54.51/7.55 # Contextual simplify-reflections : 71
% 54.51/7.55 # Paramodulations : 968
% 54.51/7.55 # Factorizations : 0
% 54.51/7.55 # NegExts : 0
% 54.51/7.55 # Equation resolutions : 2044
% 54.51/7.55 # Disequality decompositions : 0
% 54.51/7.55 # Total rewrite steps : 575
% 54.51/7.55 # ...of those cached : 458
% 54.51/7.55 # Propositional unsat checks : 2
% 54.51/7.55 # Propositional check models : 2
% 54.51/7.55 # Propositional check unsatisfiable : 0
% 54.51/7.55 # Propositional clauses : 0
% 54.51/7.55 # Propositional clauses after purity: 0
% 54.51/7.55 # Propositional unsat core size : 0
% 54.51/7.55 # Propositional preprocessing time : 0.000
% 54.51/7.55 # Propositional encoding time : 0.042
% 54.51/7.55 # Propositional solver time : 0.002
% 54.51/7.55 # Success case prop preproc time : 0.000
% 54.51/7.55 # Success case prop encoding time : 0.000
% 54.51/7.55 # Success case prop solver time : 0.000
% 54.51/7.55 # Current number of processed clauses : 470
% 54.51/7.55 # Positive orientable unit clauses : 288
% 54.51/7.55 # Positive unorientable unit clauses: 0
% 54.51/7.55 # Negative unit clauses : 30
% 54.51/7.55 # Non-unit-clauses : 152
% 54.51/7.55 # Current number of unprocessed clauses: 4350
% 54.51/7.55 # ...number of literals in the above : 44870
% 54.51/7.55 # Current number of archived formulas : 0
% 54.51/7.55 # Current number of archived clauses : 4043
% 54.51/7.55 # Clause-clause subsumption calls (NU) : 8148012
% 54.51/7.55 # Rec. Clause-clause subsumption calls : 82493
% 54.51/7.55 # Non-unit clause-clause subsumptions : 978
% 54.51/7.55 # Unit Clause-clause subsumption calls : 4847
% 54.51/7.55 # Rewrite failures with RHS unbound : 0
% 54.51/7.55 # BW rewrite match attempts : 9
% 54.51/7.55 # BW rewrite match successes : 9
% 54.51/7.55 # Condensation attempts : 0
% 54.51/7.55 # Condensation successes : 0
% 54.51/7.55 # Termbank termtop insertions : 868554
% 54.51/7.55 # Search garbage collected termcells : 32116
% 54.51/7.55
% 54.51/7.55 # -------------------------------------------------
% 54.51/7.55 # User time : 6.688 s
% 54.51/7.55 # System time : 0.043 s
% 54.51/7.55 # Total time : 6.731 s
% 54.51/7.55 # Maximum resident set size: 14380 pages
% 54.51/7.55
% 54.51/7.55 # -------------------------------------------------
% 54.51/7.55 # User time : 33.533 s
% 54.51/7.55 # System time : 0.150 s
% 54.51/7.55 # Total time : 33.683 s
% 54.51/7.55 # Maximum resident set size: 1896 pages
% 54.51/7.55 % E---3.1 exiting
%------------------------------------------------------------------------------