TSTP Solution File: NUM693_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM693_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:56:19 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 26 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 13 ~; 3 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
more: ( nat * nat ) > $o ).
tff(decl_24,type,
n_1: nat ).
tff(decl_25,type,
suc: nat > nat ).
tff(decl_26,type,
pl: ( nat * nat ) > nat ).
tff(decl_27,type,
esk1_1: nat > nat ).
tff(satz18,axiom,
! [X2: nat,X4: nat] : more(pl(X2,X4),X2),
file('/export/starexec/sandbox/tmp/tmp.Ni1gL8ShY0/E---3.1_30456.p',satz18) ).
tff(satz4g,axiom,
! [X2: nat] : ( suc(X2) = pl(n_1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Ni1gL8ShY0/E---3.1_30456.p',satz4g) ).
tff(satz3,axiom,
! [X2: nat] :
( ( X2 != n_1 )
=> ~ ! [X3: nat] : ( X2 != suc(X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ni1gL8ShY0/E---3.1_30456.p',satz3) ).
tff(satz24,conjecture,
( ~ more(x,n_1)
=> ( x = n_1 ) ),
file('/export/starexec/sandbox/tmp/tmp.Ni1gL8ShY0/E---3.1_30456.p',satz24) ).
tff(c_0_4,plain,
! [X8: nat,X9: nat] : more(pl(X8,X9),X8),
inference(variable_rename,[status(thm)],[satz18]) ).
tff(c_0_5,plain,
! [X7: nat] : ( suc(X7) = pl(n_1,X7) ),
inference(variable_rename,[status(thm)],[satz4g]) ).
tff(c_0_6,plain,
! [X2: nat] :
( ( X2 != n_1 )
=> ~ ! [X3: nat] : ( X2 != suc(X3) ) ),
inference(fof_simplification,[status(thm)],[satz3]) ).
tff(c_0_7,negated_conjecture,
~ ( ~ more(x,n_1)
=> ( x = n_1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz24])]) ).
tcf(c_0_8,plain,
! [X3: nat,X2: nat] : more(pl(X2,X3),X2),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,plain,
! [X2: nat] : suc(X2) = pl(n_1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tff(c_0_10,plain,
! [X5: nat] :
( ( X5 = n_1 )
| ( X5 = suc(esk1_1(X5)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_11,negated_conjecture,
( ~ more(x,n_1)
& ( x != n_1 ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
tcf(c_0_12,plain,
! [X2: nat] : more(suc(X2),n_1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
tcf(c_0_13,plain,
! [X2: nat] :
( ( X2 = n_1 )
| ( X2 = suc(esk1_1(X2)) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_14,negated_conjecture,
~ more(x,n_1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,plain,
! [X2: nat] :
( ( X2 = n_1 )
| more(X2,n_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_16,negated_conjecture,
x != n_1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM693_8 : TPTP v8.1.2. Released v8.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 09:28:18 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.Ni1gL8ShY0/E---3.1_30456.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 30537 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 30543 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 11
% 0.21/0.51 # Removed by relevancy pruning/SinE : 7
% 0.21/0.51 # Initial clauses : 5
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 12
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 12
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 3
% 0.21/0.51 # ...of the previous two non-redundant : 2
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 3
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 0
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 7
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 2
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 5
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 246
% 0.21/0.51 # Search garbage collected termcells : 35
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.003 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.004 s
% 0.21/0.51 # Maximum resident set size: 1600 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.006 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.007 s
% 0.21/0.51 # Maximum resident set size: 1708 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------