TSTP Solution File: ROB011-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 20:56:14 EDT 2022
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 18 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(negate(add(a,negate(b))),c),
file('ROB011-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(negate(add(a,negate(add(b,multiply(one,add(a,c)))))),c),
file('ROB011-1.p',unknown),
[] ).
cnf(3,axiom,
equal(add(u,v),add(v,u)),
file('ROB011-1.p',unknown),
[] ).
cnf(4,axiom,
equal(add(add(u,v),w),add(u,add(v,w))),
file('ROB011-1.p',unknown),
[] ).
cnf(5,axiom,
equal(negate(add(negate(add(u,v)),negate(add(u,negate(v))))),u),
file('ROB011-1.p',unknown),
[] ).
cnf(6,axiom,
equal(multiply(one,u),u),
file('ROB011-1.p',unknown),
[] ).
cnf(10,plain,
~ equal(negate(add(a,negate(add(b,add(a,c))))),c),
inference(rew,[status(thm),theory(equality)],[6,2]),
[iquote('0:Rew:6.0,2.0')] ).
cnf(17,plain,
equal(add(u,add(v,w)),add(v,add(w,u))),
inference(spr,[status(thm),theory(equality)],[4,3]),
[iquote('0:SpR:4.0,3.0')] ).
cnf(21,plain,
equal(add(add(u,v),w),add(v,add(u,w))),
inference(spr,[status(thm),theory(equality)],[3,4]),
[iquote('0:SpR:3.0,4.0')] ).
cnf(23,plain,
~ equal(negate(add(a,negate(add(a,add(c,b))))),c),
inference(rew,[status(thm),theory(equality)],[17,10]),
[iquote('0:Rew:17.0,10.0')] ).
cnf(24,plain,
equal(add(u,add(v,w)),add(v,add(u,w))),
inference(rew,[status(thm),theory(equality)],[4,21]),
[iquote('0:Rew:4.0,21.0')] ).
cnf(26,plain,
~ equal(negate(add(a,negate(add(a,add(b,c))))),c),
inference(rew,[status(thm),theory(equality)],[3,23]),
[iquote('0:Rew:3.0,23.0')] ).
cnf(44,plain,
equal(add(u,add(v,w)),add(w,add(v,u))),
inference(spr,[status(thm),theory(equality)],[3,17]),
[iquote('0:SpR:3.0,17.0')] ).
cnf(276,plain,
equal(negate(add(negate(add(a,b)),c)),a),
inference(spr,[status(thm),theory(equality)],[1,5]),
[iquote('0:SpR:1.0,5.0')] ).
cnf(289,plain,
equal(negate(add(c,negate(add(a,b)))),a),
inference(rew,[status(thm),theory(equality)],[3,276]),
[iquote('0:Rew:3.0,276.0')] ).
cnf(295,plain,
equal(negate(add(negate(add(c,add(a,b))),a)),c),
inference(spr,[status(thm),theory(equality)],[289,5]),
[iquote('0:SpR:289.0,5.0')] ).
cnf(299,plain,
equal(negate(add(a,negate(add(a,add(b,c))))),c),
inference(rew,[status(thm),theory(equality)],[3,295,24,44]),
[iquote('0:Rew:3.0,295.0,24.0,295.0,44.0,295.0')] ).
cnf(300,plain,
$false,
inference(mrr,[status(thm)],[299,26]),
[iquote('0:MRR:299.0,26.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.20/0.34 % Computer : n018.cluster.edu
% 0.20/0.34 % Model : x86_64 x86_64
% 0.20/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.34 % Memory : 8042.1875MB
% 0.20/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.34 % CPULimit : 300
% 0.20/0.34 % WCLimit : 600
% 0.20/0.34 % DateTime : Thu Jun 9 16:08:53 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 198 clauses, backtracked 0 clauses, performed 0 splits and kept 46 clauses.
% 0.20/0.45 SPASS allocated 75864 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.03 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 18 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : condition prove_base_step commutativity_of_add associativity_of_add robbins_axiom one_times_x
% 0.20/0.45
%------------------------------------------------------------------------------