TSTP Solution File: NUM568+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM568+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 18:56:24 EDT 2023
% Result : Theorem 29.79s 4.40s
% Output : CNFRefutation 29.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 31 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 12 ~; 11 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn; 3 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xK ),
file('/export/starexec/sandbox/tmp/tmp.fklkIbSv6n/E---3.1_25122.p',m__) ).
fof(mNatExtra,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( X1 = sz00
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& X1 = szszuzczcdt0(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fklkIbSv6n/E---3.1_25122.p',mNatExtra) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.fklkIbSv6n/E---3.1_25122.p',m__3418) ).
fof(m__3462,hypothesis,
xK != sz00,
file('/export/starexec/sandbox/tmp/tmp.fklkIbSv6n/E---3.1_25122.p',m__3462) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xK ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X30] :
( ( aElementOf0(esk10_1(X30),szNzAzT0)
| X30 = sz00
| ~ aElementOf0(X30,szNzAzT0) )
& ( X30 = szszuzczcdt0(esk10_1(X30))
| X30 = sz00
| ~ aElementOf0(X30,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])]) ).
fof(c_0_6,negated_conjecture,
! [X8] :
( ~ aElementOf0(X8,szNzAzT0)
| szszuzczcdt0(X8) != xK ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
( X1 = szszuzczcdt0(esk10_1(X1))
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_9,hypothesis,
xK != sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xK ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
szszuzczcdt0(esk10_1(xK)) = xK,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
( aElementOf0(esk10_1(X1),szNzAzT0)
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(esk10_1(xK),szNzAzT0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_9]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM568+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n026.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 14:53:14 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.fklkIbSv6n/E---3.1_25122.p
% 29.79/4.40 # Version: 3.1pre001
% 29.79/4.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.79/4.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.79/4.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.79/4.40 # Starting new_bool_3 with 300s (1) cores
% 29.79/4.40 # Starting new_bool_1 with 300s (1) cores
% 29.79/4.40 # Starting sh5l with 300s (1) cores
% 29.79/4.40 # sh5l with pid 25225 completed with status 0
% 29.79/4.40 # Result found by sh5l
% 29.79/4.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.79/4.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.79/4.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.79/4.40 # Starting new_bool_3 with 300s (1) cores
% 29.79/4.40 # Starting new_bool_1 with 300s (1) cores
% 29.79/4.40 # Starting sh5l with 300s (1) cores
% 29.79/4.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 29.79/4.40 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.79/4.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.79/4.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 29.79/4.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 25236 completed with status 0
% 29.79/4.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 29.79/4.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.79/4.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.79/4.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.79/4.40 # Starting new_bool_3 with 300s (1) cores
% 29.79/4.40 # Starting new_bool_1 with 300s (1) cores
% 29.79/4.40 # Starting sh5l with 300s (1) cores
% 29.79/4.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 29.79/4.40 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.79/4.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.79/4.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 29.79/4.40 # Preprocessing time : 0.145 s
% 29.79/4.40 # Presaturation interreduction done
% 29.79/4.40
% 29.79/4.40 # Proof found!
% 29.79/4.40 # SZS status Theorem
% 29.79/4.40 # SZS output start CNFRefutation
% See solution above
% 29.79/4.40 # Parsed axioms : 80
% 29.79/4.40 # Removed by relevancy pruning/SinE : 2
% 29.79/4.40 # Initial clauses : 4129
% 29.79/4.40 # Removed in clause preprocessing : 7
% 29.79/4.40 # Initial clauses in saturation : 4122
% 29.79/4.40 # Processed clauses : 5990
% 29.79/4.40 # ...of these trivial : 0
% 29.79/4.40 # ...subsumed : 576
% 29.79/4.40 # ...remaining for further processing : 5414
% 29.79/4.40 # Other redundant clauses eliminated : 1929
% 29.79/4.40 # Clauses deleted for lack of memory : 0
% 29.79/4.40 # Backward-subsumed : 0
% 29.79/4.40 # Backward-rewritten : 2
% 29.79/4.40 # Generated clauses : 2098
% 29.79/4.40 # ...of the previous two non-redundant : 2067
% 29.79/4.40 # ...aggressively subsumed : 0
% 29.79/4.40 # Contextual simplify-reflections : 13
% 29.79/4.40 # Paramodulations : 362
% 29.79/4.40 # Factorizations : 0
% 29.79/4.40 # NegExts : 0
% 29.79/4.40 # Equation resolutions : 1930
% 29.79/4.40 # Total rewrite steps : 56
% 29.79/4.40 # Propositional unsat checks : 0
% 29.79/4.40 # Propositional check models : 0
% 29.79/4.40 # Propositional check unsatisfiable : 0
% 29.79/4.40 # Propositional clauses : 0
% 29.79/4.40 # Propositional clauses after purity: 0
% 29.79/4.40 # Propositional unsat core size : 0
% 29.79/4.40 # Propositional preprocessing time : 0.000
% 29.79/4.40 # Propositional encoding time : 0.000
% 29.79/4.40 # Propositional solver time : 0.000
% 29.79/4.40 # Success case prop preproc time : 0.000
% 29.79/4.40 # Success case prop encoding time : 0.000
% 29.79/4.40 # Success case prop solver time : 0.000
% 29.79/4.40 # Current number of processed clauses : 123
% 29.79/4.40 # Positive orientable unit clauses : 60
% 29.79/4.40 # Positive unorientable unit clauses: 0
% 29.79/4.40 # Negative unit clauses : 18
% 29.79/4.40 # Non-unit-clauses : 45
% 29.79/4.40 # Current number of unprocessed clauses: 3752
% 29.79/4.40 # ...number of literals in the above : 41986
% 29.79/4.40 # Current number of archived formulas : 0
% 29.79/4.40 # Current number of archived clauses : 3556
% 29.79/4.40 # Clause-clause subsumption calls (NU) : 3743107
% 29.79/4.40 # Rec. Clause-clause subsumption calls : 67342
% 29.79/4.40 # Non-unit clause-clause subsumptions : 581
% 29.79/4.40 # Unit Clause-clause subsumption calls : 505
% 29.79/4.40 # Rewrite failures with RHS unbound : 0
% 29.79/4.40 # BW rewrite match attempts : 176
% 29.79/4.40 # BW rewrite match successes : 2
% 29.79/4.40 # Condensation attempts : 0
% 29.79/4.40 # Condensation successes : 0
% 29.79/4.40 # Termbank termtop insertions : 600619
% 29.79/4.40
% 29.79/4.40 # -------------------------------------------------
% 29.79/4.40 # User time : 3.850 s
% 29.79/4.40 # System time : 0.035 s
% 29.79/4.40 # Total time : 3.885 s
% 29.79/4.40 # Maximum resident set size: 13144 pages
% 29.79/4.40
% 29.79/4.40 # -------------------------------------------------
% 29.79/4.40 # User time : 3.852 s
% 29.79/4.40 # System time : 0.039 s
% 29.79/4.40 # Total time : 3.890 s
% 29.79/4.40 # Maximum resident set size: 1792 pages
% 29.79/4.40 % E---3.1 exiting
% 29.79/4.40 % E---3.1 exiting
%------------------------------------------------------------------------------