TSTP Solution File: SWV046+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV046+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : Wed Jul 20 18:14:59 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 27 unt; 0 def)
% Number of atoms : 74 ( 48 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 65 ( 23 ~; 15 |; 21 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 15 con; 0-3 aty)
% Number of variables : 22 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0010,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_norm_0010) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(c_0_8,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0010]) ).
fof(c_0_9,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( n0 = pv44
| n0 != pv44 )
& ( ~ true
| n0 != pv44 )
& ( n0 = pv44
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& ( ~ true
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_10,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_11,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_12,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_13,negated_conjecture,
( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| ~ true ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_15,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X18,X19,X20] : a_select2(tptp_update2(X18,X19,X20),X19) = X20,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
cnf(c_0_18,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_22,negated_conjecture,
( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0
| sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
fof(c_0_27,plain,
! [X24] : sum(n0,tptp_minus_1,X24) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_28,negated_conjecture,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),c_0_24]),c_0_24]) ).
cnf(c_0_29,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV046+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.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 : Tue Jun 14 16:01:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.019 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 32
% 0.22/1.40 # Proof object clause steps : 17
% 0.22/1.40 # Proof object formula steps : 15
% 0.22/1.40 # Proof object conjectures : 10
% 0.22/1.40 # Proof object clause conjectures : 7
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 11
% 0.22/1.40 # Proof object initial formulas used : 8
% 0.22/1.40 # Proof object generating inferences : 1
% 0.22/1.40 # Proof object simplifying inferences : 14
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 92
% 0.22/1.40 # Removed by relevancy pruning/SinE : 19
% 0.22/1.40 # Initial clauses : 85
% 0.22/1.40 # Removed in clause preprocessing : 3
% 0.22/1.40 # Initial clauses in saturation : 82
% 0.22/1.40 # Processed clauses : 98
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 1
% 0.22/1.40 # ...remaining for further processing : 97
% 0.22/1.40 # Other redundant clauses eliminated : 1
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 6
% 0.22/1.40 # Generated clauses : 258
% 0.22/1.40 # ...of the previous two non-trivial : 227
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 254
% 0.22/1.40 # Factorizations : 2
% 0.22/1.40 # Equation resolutions : 2
% 0.22/1.40 # Current number of processed clauses : 91
% 0.22/1.40 # Positive orientable unit clauses : 61
% 0.22/1.40 # Positive unorientable unit clauses: 4
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 24
% 0.22/1.40 # Current number of unprocessed clauses: 207
% 0.22/1.40 # ...number of literals in the above : 399
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 8
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 43
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 12
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 85
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 21
% 0.22/1.40 # BW rewrite match successes : 18
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 6868
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.027 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.029 s
% 0.22/1.40 # Maximum resident set size: 3480 pages
%------------------------------------------------------------------------------