TSTP Solution File: NUM713_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM713_8 : TPTP v8.2.0. Released v8.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 : Tue May 21 01:15:48 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 12 ( 12 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
z: nat ).
tff(decl_25,type,
pl: ( nat * nat ) > nat ).
tff(decl_26,type,
ts: ( nat * nat ) > nat ).
tff(decl_27,type,
esk1_0: nat ).
tff(satz32a,conjecture,
~ ! [X1: nat] : ( ts(x,z) != pl(ts(y,z),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz32a) ).
tff(satz30,axiom,
! [X3: nat,X4: nat,X5: nat] : ( ts(X3,pl(X4,X5)) = pl(ts(X3,X4),ts(X3,X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz30) ).
tff(satz29,axiom,
! [X3: nat,X4: nat] : ( ts(X3,X4) = ts(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz29) ).
tff(m,axiom,
~ ! [X1: nat] : ( x != pl(y,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
tff(c_0_4,negated_conjecture,
~ ~ ! [X1: nat] : ( ts(x,z) != pl(ts(y,z),X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz32a])]) ).
tff(c_0_5,plain,
! [X8: nat,X9: nat,X10: nat] : ( ts(X8,pl(X9,X10)) = pl(ts(X8,X9),ts(X8,X10)) ),
inference(variable_rename,[status(thm)],[satz30]) ).
tff(c_0_6,plain,
! [X11: nat,X12: nat] : ( ts(X11,X12) = ts(X12,X11) ),
inference(variable_rename,[status(thm)],[satz29]) ).
tff(c_0_7,negated_conjecture,
! [X6: nat] : ( ts(x,z) != pl(ts(y,z),X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tcf(c_0_8,plain,
! [X1: nat,X3: nat,X4: nat] : ts(X1,pl(X3,X4)) = pl(ts(X1,X3),ts(X1,X4)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X3: nat,X1: nat] : ts(X1,X3) = ts(X3,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tff(c_0_10,plain,
~ ! [X1: nat] : ( x != pl(y,X1) ),
inference(fof_simplification,[status(thm)],[m]) ).
tcf(c_0_11,negated_conjecture,
! [X1: nat] : ts(x,z) != pl(ts(y,z),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X1: nat,X3: nat,X4: nat] : pl(ts(X1,X3),ts(X3,X4)) = ts(X3,pl(X1,X4)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
tff(c_0_13,plain,
x = pl(y,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
tcf(c_0_14,negated_conjecture,
! [X1: nat] : ts(z,pl(y,X1)) != ts(x,z),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_15,plain,
x = pl(y,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_16,plain,
! [X3: nat,X1: nat] : ts(X1,X3) = ts(X3,X1),
c_0_9 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : NUM713_8 : TPTP v8.2.0. Released v8.0.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n020.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 05:19:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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/benchmark/theBenchmark.p
% 0.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # new_bool_3 with pid 16340 completed with status 0
% 0.14/0.40 # Result found by new_bool_3
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.14/0.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 16343 completed with status 0
% 0.14/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 11
% 0.14/0.40 # Removed by relevancy pruning/SinE : 7
% 0.14/0.40 # Initial clauses : 4
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 4
% 0.14/0.40 # Processed clauses : 14
% 0.14/0.40 # ...of these trivial : 1
% 0.14/0.40 # ...subsumed : 1
% 0.14/0.40 # ...remaining for further processing : 12
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 0
% 0.14/0.40 # Generated clauses : 17
% 0.14/0.40 # ...of the previous two non-redundant : 12
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 17
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 5
% 0.14/0.40 # ...of those cached : 2
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 8
% 0.14/0.40 # Positive orientable unit clauses : 4
% 0.14/0.40 # Positive unorientable unit clauses: 1
% 0.14/0.40 # Negative unit clauses : 3
% 0.14/0.40 # Non-unit-clauses : 0
% 0.14/0.40 # Current number of unprocessed clauses: 6
% 0.14/0.40 # ...number of literals in the above : 6
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 4
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 3
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 11
% 0.14/0.40 # BW rewrite match successes : 8
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 407
% 0.14/0.40 # Search garbage collected termcells : 24
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.001 s
% 0.14/0.40 # System time : 0.002 s
% 0.14/0.40 # Total time : 0.004 s
% 0.14/0.40 # Maximum resident set size: 1596 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.002 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.006 s
% 0.14/0.40 # Maximum resident set size: 1716 pages
% 0.14/0.40 % E---3.1 exiting
% 0.14/0.40 % E exiting
%------------------------------------------------------------------------------