TSTP Solution File: NUM624+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n020.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 08:55:47 EDT 2024
% Result : Theorem 54.53s 7.48s
% Output : CNFRefutation 54.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 75 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 67 ( 23 ~; 17 |; 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 : 17 ( 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.0ydWI9Bflp/E---3.1_7339.p',m__5348) ).
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.0ydWI9Bflp/E---3.1_7339.p',mLessASymm) ).
fof(m__5365,hypothesis,
( aElementOf0(xx,szNzAzT0)
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xx ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__5365) ).
fof(m__5106,hypothesis,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xQ,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__5106) ).
fof(m__5147,hypothesis,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& xp = szmzizndt0(xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__5147) ).
fof(m__5401,hypothesis,
! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> sdtlseqdt0(xx,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__5401) ).
fof(m__,conjecture,
xp = xx,
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__) ).
fof(m__5481,hypothesis,
( aElementOf0(xp,sdtlpdtrp0(xN,xm))
& aElementOf0(xx,xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ydWI9Bflp/E---3.1_7339.p',m__5481) ).
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,plain,
! [X28,X29] :
( ~ aElementOf0(X28,szNzAzT0)
| ~ aElementOf0(X29,szNzAzT0)
| ~ sdtlseqdt0(X28,X29)
| ~ sdtlseqdt0(X29,X28)
| X28 = X29 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
fof(c_0_10,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(esk1_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk1_0) = xx ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5365])]) ).
fof(c_0_11,hypothesis,
! [X69] :
( ( ~ aElementOf0(X69,xQ)
| aElementOf0(X69,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_12,hypothesis,
! [X10] :
( aElementOf0(xp,xQ)
& ( ~ aElementOf0(X10,xQ)
| sdtlseqdt0(xp,X10) )
& 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_13,hypothesis,
! [X9] :
( ~ aElementOf0(X9,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5401])])]) ).
fof(c_0_14,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xP) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
xp != xx,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
( sdtlseqdt0(xx,X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5481]) ).
cnf(c_0_22,hypothesis,
( sdtlseqdt0(xp,X1)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,negated_conjecture,
xp != xx,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_25,hypothesis,
( X1 = xx
| ~ sdtlseqdt0(xx,X1)
| ~ sdtlseqdt0(X1,xx)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xp,szNzAzT0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,hypothesis,
sdtlseqdt0(xx,xp),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,hypothesis,
sdtlseqdt0(xp,xx),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
xp != xx,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : NUM624+3 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 09:15:16 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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.0ydWI9Bflp/E---3.1_7339.p
% 54.53/7.48 # Version: 3.1.0
% 54.53/7.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.53/7.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.53/7.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.53/7.48 # Starting new_bool_3 with 300s (1) cores
% 54.53/7.48 # Starting new_bool_1 with 300s (1) cores
% 54.53/7.48 # Starting sh5l with 300s (1) cores
% 54.53/7.48 # sh5l with pid 7420 completed with status 0
% 54.53/7.48 # Result found by sh5l
% 54.53/7.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.53/7.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.53/7.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.53/7.48 # Starting new_bool_3 with 300s (1) cores
% 54.53/7.48 # Starting new_bool_1 with 300s (1) cores
% 54.53/7.48 # Starting sh5l with 300s (1) cores
% 54.53/7.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 54.53/7.48 # Search class: FGHSF-SMLM32-MFFFFFNN
% 54.53/7.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 54.53/7.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 54.53/7.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 7421 completed with status 0
% 54.53/7.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 54.53/7.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 54.53/7.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.53/7.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 54.53/7.48 # Starting new_bool_3 with 300s (1) cores
% 54.53/7.48 # Starting new_bool_1 with 300s (1) cores
% 54.53/7.48 # Starting sh5l with 300s (1) cores
% 54.53/7.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 54.53/7.48 # Search class: FGHSF-SMLM32-MFFFFFNN
% 54.53/7.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 54.53/7.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 54.53/7.48 # Preprocessing time : 0.163 s
% 54.53/7.48 # Presaturation interreduction done
% 54.53/7.48
% 54.53/7.48 # Proof found!
% 54.53/7.48 # SZS status Theorem
% 54.53/7.48 # SZS output start CNFRefutation
% See solution above
% 54.53/7.48 # Parsed axioms : 121
% 54.53/7.48 # Removed by relevancy pruning/SinE : 2
% 54.53/7.48 # Initial clauses : 4929
% 54.53/7.48 # Removed in clause preprocessing : 7
% 54.53/7.48 # Initial clauses in saturation : 4922
% 54.53/7.48 # Processed clauses : 9539
% 54.53/7.48 # ...of these trivial : 51
% 54.53/7.48 # ...subsumed : 1611
% 54.53/7.48 # ...remaining for further processing : 7877
% 54.53/7.48 # Other redundant clauses eliminated : 2038
% 54.53/7.48 # Clauses deleted for lack of memory : 0
% 54.53/7.48 # Backward-subsumed : 27
% 54.53/7.48 # Backward-rewritten : 44
% 54.53/7.48 # Generated clauses : 13789
% 54.53/7.48 # ...of the previous two non-redundant : 13312
% 54.53/7.48 # ...aggressively subsumed : 0
% 54.53/7.48 # Contextual simplify-reflections : 83
% 54.53/7.48 # Paramodulations : 11946
% 54.53/7.48 # Factorizations : 2
% 54.53/7.48 # NegExts : 0
% 54.53/7.48 # Equation resolutions : 2041
% 54.53/7.48 # Disequality decompositions : 0
% 54.53/7.48 # Total rewrite steps : 6457
% 54.53/7.48 # ...of those cached : 6056
% 54.53/7.48 # Propositional unsat checks : 0
% 54.53/7.48 # Propositional check models : 0
% 54.53/7.48 # Propositional check unsatisfiable : 0
% 54.53/7.48 # Propositional clauses : 0
% 54.53/7.48 # Propositional clauses after purity: 0
% 54.53/7.48 # Propositional unsat core size : 0
% 54.53/7.48 # Propositional preprocessing time : 0.000
% 54.53/7.48 # Propositional encoding time : 0.000
% 54.53/7.48 # Propositional solver time : 0.000
% 54.53/7.48 # Success case prop preproc time : 0.000
% 54.53/7.48 # Success case prop encoding time : 0.000
% 54.53/7.48 # Success case prop solver time : 0.000
% 54.53/7.48 # Current number of processed clauses : 1961
% 54.53/7.48 # Positive orientable unit clauses : 908
% 54.53/7.48 # Positive unorientable unit clauses: 0
% 54.53/7.48 # Negative unit clauses : 130
% 54.53/7.48 # Non-unit-clauses : 923
% 54.53/7.48 # Current number of unprocessed clauses: 12673
% 54.53/7.48 # ...number of literals in the above : 75736
% 54.53/7.48 # Current number of archived formulas : 0
% 54.53/7.48 # Current number of archived clauses : 4080
% 54.53/7.48 # Clause-clause subsumption calls (NU) : 9594283
% 54.53/7.48 # Rec. Clause-clause subsumption calls : 124405
% 54.53/7.48 # Non-unit clause-clause subsumptions : 1441
% 54.53/7.48 # Unit Clause-clause subsumption calls : 49115
% 54.53/7.48 # Rewrite failures with RHS unbound : 0
% 54.53/7.48 # BW rewrite match attempts : 908
% 54.53/7.48 # BW rewrite match successes : 22
% 54.53/7.48 # Condensation attempts : 0
% 54.53/7.48 # Condensation successes : 0
% 54.53/7.48 # Termbank termtop insertions : 870293
% 54.53/7.48 # Search garbage collected termcells : 31928
% 54.53/7.48
% 54.53/7.48 # -------------------------------------------------
% 54.53/7.48 # User time : 6.931 s
% 54.53/7.48 # System time : 0.051 s
% 54.53/7.48 # Total time : 6.982 s
% 54.53/7.48 # Maximum resident set size: 14512 pages
% 54.53/7.48
% 54.53/7.48 # -------------------------------------------------
% 54.53/7.48 # User time : 6.935 s
% 54.53/7.48 # System time : 0.056 s
% 54.53/7.48 # Total time : 6.990 s
% 54.53/7.48 # Maximum resident set size: 1896 pages
% 54.53/7.48 % E---3.1 exiting
% 54.53/7.48 % E exiting
%------------------------------------------------------------------------------