TSTP Solution File: NUM341+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM341+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 : 600s
% DateTime : Mon Jul 18 09:31:43 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 11 ~; 11 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 39 ( 12 sgn 15 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(add_same_as_subtract,conjecture,
? [X1,X2,X3] :
( sum(X1,X2,X3)
<=> ( difference(X3,X2,X1)
& difference(X3,X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',add_same_as_subtract) ).
fof(minus_entry_point,axiom,
! [X1,X2,X3] :
( sum(X2,X3,X1)
<=> difference(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',minus_entry_point) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3] :
( sum(X1,X2,X3)
<=> ( difference(X3,X2,X1)
& difference(X3,X1,X2) ) ),
inference(assume_negation,[status(cth)],[add_same_as_subtract]) ).
fof(c_0_3,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ sum(X5,X6,X4)
| difference(X4,X5,X6) )
& ( ~ difference(X4,X5,X6)
| sum(X5,X6,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus_entry_point])])])]) ).
fof(c_0_4,negated_conjecture,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ sum(X4,X5,X6)
| ~ difference(X6,X5,X4)
| ~ difference(X6,X4,X5) )
& ( difference(X6,X5,X4)
| sum(X4,X5,X6) )
& ( difference(X6,X4,X5)
| sum(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_5,plain,
( sum(X1,X2,X3)
| ~ difference(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( sum(X1,X2,X3)
| difference(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( difference(X1,X2,X3)
| ~ sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
sum(X1,X2,X3),
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ difference(X1,X2,X3)
| ~ difference(X1,X3,X2)
| ~ sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
difference(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : NUM341+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.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 : 600
% 0.12/0.33 % DateTime : Thu Jul 7 18:05:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.022 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 12
% 0.23/1.42 # Proof object clause steps : 7
% 0.23/1.42 # Proof object formula steps : 5
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 4
% 0.23/1.42 # Proof object initial formulas used : 2
% 0.23/1.42 # Proof object generating inferences : 0
% 0.23/1.42 # Proof object simplifying inferences : 7
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 402
% 0.23/1.42 # Removed by relevancy pruning/SinE : 301
% 0.23/1.42 # Initial clauses : 104
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 104
% 0.23/1.42 # Processed clauses : 23
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 22
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 4
% 0.23/1.42 # Generated clauses : 108
% 0.23/1.42 # ...of the previous two non-trivial : 110
% 0.23/1.42 # Contextual simplify-reflections : 1
% 0.23/1.42 # Paramodulations : 108
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 18
% 0.23/1.42 # Positive orientable unit clauses : 17
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 191
% 0.23/1.42 # ...number of literals in the above : 223
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 4
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 5
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 5
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 17
% 0.23/1.42 # Rewrite failures with RHS unbound : 52
% 0.23/1.42 # BW rewrite match attempts : 58
% 0.23/1.42 # BW rewrite match successes : 58
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 8841
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.024 s
% 0.23/1.42 # System time : 0.000 s
% 0.23/1.42 # Total time : 0.024 s
% 0.23/1.42 # Maximum resident set size: 4008 pages
%------------------------------------------------------------------------------