TSTP Solution File: NUM613+3 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : NUM613+3 : 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 : Mon Jun 24 12:36:05 EDT 2024
% Result : Theorem 43.67s 6.24s
% Output : CNFRefutation 43.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 43 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 36 ( 12 ~; 9 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.VCegjk6YCU/E---3.1_25704.p',mSuccEquSucc) ).
fof(m__5078,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/tmp/tmp.VCegjk6YCU/E---3.1_25704.p',m__5078) ).
fof(m__,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/tmp/tmp.VCegjk6YCU/E---3.1_25704.p',m__) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/tmp/tmp.VCegjk6YCU/E---3.1_25704.p',m__3533) ).
fof(m__5255,hypothesis,
( sbrdtbr0(xQ) = szszuzczcdt0(xk)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.VCegjk6YCU/E---3.1_25704.p',m__5255) ).
fof(c_0_5,plain,
! [X60,X61] :
( ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X61,szNzAzT0)
| szszuzczcdt0(X60) != szszuzczcdt0(X61)
| X60 = X61 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])])]) ).
fof(c_0_6,hypothesis,
! [X255] :
( aSet0(xQ)
& ( ~ aElementOf0(X255,xQ)
| aElementOf0(X255,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_7,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_11,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_12,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_15,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_17,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.16 % Problem : NUM613+3 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n022.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun Jun 23 02:57:54 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.24/0.57 Running first-order theorem proving
% 0.24/0.57 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.VCegjk6YCU/E---3.1_25704.p
% 43.67/6.24 # Version: 3.2.0
% 43.67/6.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 43.67/6.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.67/6.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 43.67/6.24 # Starting new_bool_3 with 300s (1) cores
% 43.67/6.24 # Starting new_bool_1 with 300s (1) cores
% 43.67/6.24 # Starting sh5l with 300s (1) cores
% 43.67/6.24 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25782 completed with status 0
% 43.67/6.24 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 43.67/6.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 43.67/6.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.67/6.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 43.67/6.24 # No SInE strategy applied
% 43.67/6.24 # Search class: FGHSF-SMLM32-MFFFFFNN
% 43.67/6.24 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 43.67/6.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 43.67/6.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 43.67/6.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 43.67/6.24 # Starting new_bool_3 with 136s (1) cores
% 43.67/6.24 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 43.67/6.24 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25792 completed with status 0
% 43.67/6.24 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 43.67/6.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 43.67/6.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.67/6.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 43.67/6.24 # No SInE strategy applied
% 43.67/6.24 # Search class: FGHSF-SMLM32-MFFFFFNN
% 43.67/6.24 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 43.67/6.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 43.67/6.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 43.67/6.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 43.67/6.24 # Starting new_bool_3 with 136s (1) cores
% 43.67/6.24 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 43.67/6.24 # Preprocessing time : 0.111 s
% 43.67/6.24 # Presaturation interreduction done
% 43.67/6.24
% 43.67/6.24 # Proof found!
% 43.67/6.24 # SZS status Theorem
% 43.67/6.24 # SZS output start CNFRefutation
% See solution above
% 43.67/6.24 # Parsed axioms : 110
% 43.67/6.24 # Removed by relevancy pruning/SinE : 0
% 43.67/6.24 # Initial clauses : 4912
% 43.67/6.24 # Removed in clause preprocessing : 7
% 43.67/6.24 # Initial clauses in saturation : 4905
% 43.67/6.24 # Processed clauses : 6987
% 43.67/6.24 # ...of these trivial : 10
% 43.67/6.24 # ...subsumed : 920
% 43.67/6.24 # ...remaining for further processing : 6057
% 43.67/6.24 # Other redundant clauses eliminated : 2044
% 43.67/6.24 # Clauses deleted for lack of memory : 0
% 43.67/6.24 # Backward-subsumed : 18
% 43.67/6.24 # Backward-rewritten : 2
% 43.67/6.24 # Generated clauses : 2109
% 43.67/6.24 # ...of the previous two non-redundant : 2052
% 43.67/6.24 # ...aggressively subsumed : 0
% 43.67/6.24 # Contextual simplify-reflections : 70
% 43.67/6.24 # Paramodulations : 264
% 43.67/6.24 # Factorizations : 0
% 43.67/6.24 # NegExts : 0
% 43.67/6.24 # Equation resolutions : 2045
% 43.67/6.24 # Disequality decompositions : 0
% 43.67/6.24 # Total rewrite steps : 220
% 43.67/6.24 # ...of those cached : 176
% 43.67/6.24 # Propositional unsat checks : 2
% 43.67/6.24 # Propositional check models : 2
% 43.67/6.24 # Propositional check unsatisfiable : 0
% 43.67/6.24 # Propositional clauses : 0
% 43.67/6.24 # Propositional clauses after purity: 0
% 43.67/6.24 # Propositional unsat core size : 0
% 43.67/6.24 # Propositional preprocessing time : 0.000
% 43.67/6.24 # Propositional encoding time : 0.040
% 43.67/6.24 # Propositional solver time : 0.001
% 43.67/6.24 # Success case prop preproc time : 0.000
% 43.67/6.24 # Success case prop encoding time : 0.000
% 43.67/6.24 # Success case prop solver time : 0.000
% 43.67/6.24 # Current number of processed clauses : 198
% 43.67/6.24 # Positive orientable unit clauses : 79
% 43.67/6.24 # Positive unorientable unit clauses: 0
% 43.67/6.24 # Negative unit clauses : 23
% 43.67/6.24 # Non-unit-clauses : 96
% 43.67/6.24 # Current number of unprocessed clauses: 3961
% 43.67/6.24 # ...number of literals in the above : 44312
% 43.67/6.24 # Current number of archived formulas : 0
% 43.67/6.24 # Current number of archived clauses : 4016
% 43.67/6.24 # Clause-clause subsumption calls (NU) : 8756387
% 43.67/6.24 # Rec. Clause-clause subsumption calls : 75588
% 43.67/6.24 # Non-unit clause-clause subsumptions : 981
% 43.67/6.24 # Unit Clause-clause subsumption calls : 519
% 43.67/6.24 # Rewrite failures with RHS unbound : 0
% 43.67/6.24 # BW rewrite match attempts : 2
% 43.67/6.24 # BW rewrite match successes : 2
% 43.67/6.24 # Condensation attempts : 0
% 43.67/6.24 # Condensation successes : 0
% 43.67/6.24 # Termbank termtop insertions : 858947
% 43.67/6.24 # Search garbage collected termcells : 32022
% 43.67/6.24
% 43.67/6.24 # -------------------------------------------------
% 43.67/6.24 # User time : 5.525 s
% 43.67/6.24 # System time : 0.042 s
% 43.67/6.24 # Total time : 5.567 s
% 43.67/6.24 # Maximum resident set size: 14344 pages
% 43.67/6.24
% 43.67/6.24 # -------------------------------------------------
% 43.67/6.24 # User time : 26.801 s
% 43.67/6.24 # System time : 0.122 s
% 43.67/6.24 # Total time : 26.923 s
% 43.67/6.24 # Maximum resident set size: 1868 pages
% 43.67/6.24 % E---3.1 exiting
% 43.67/6.24 % E exiting
%------------------------------------------------------------------------------