TSTP Solution File: BOO006-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : BOO006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 : Thu Jul 14 23:49:23 EDT 2022
% Result : Unsatisfiable 0.39s 0.58s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 32 ( 0 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ product(x__dfg,additive_identity,additive_identity),
file('BOO006-1.p',unknown),
[] ).
cnf(3,axiom,
product(u,v,multiply(u,v)),
file('BOO006-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ product(u,v,w)
| product(v,u,w) ),
file('BOO006-1.p',unknown),
[] ).
cnf(6,axiom,
sum__dfg(additive_identity,u,u),
file('BOO006-1.p',unknown),
[] ).
cnf(7,axiom,
sum__dfg(u,additive_identity,u),
file('BOO006-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ sum__dfg(u,v,w)
| ~ sum__dfg(x,y,z)
| ~ product(y,x1,v)
| ~ product(x,x1,u)
| product(z,x1,w) ),
file('BOO006-1.p',unknown),
[] ).
cnf(20,axiom,
product(inverse(u),u,additive_identity),
file('BOO006-1.p',unknown),
[] ).
cnf(23,axiom,
( ~ product(u,v,w)
| ~ product(u,v,x)
| equal(x,w) ),
file('BOO006-1.p',unknown),
[] ).
cnf(25,plain,
~ product(additive_identity,x__dfg,additive_identity),
inference(res,[status(thm),theory(equality)],[5,1]),
[iquote('0:Res:5.1,1.0')] ).
cnf(43,plain,
( ~ product(inverse(u),u,v)
| equal(v,additive_identity) ),
inference(res,[status(thm),theory(equality)],[20,23]),
[iquote('0:Res:20.0,23.0')] ).
cnf(80,plain,
( ~ sum__dfg(u,v,w)
| ~ product(v,x,y)
| ~ product(u,x,additive_identity)
| product(w,x,y) ),
inference(res,[status(thm),theory(equality)],[6,13]),
[iquote('0:Res:6.0,13.0')] ).
cnf(481,plain,
( ~ product(additive_identity,u,v)
| ~ product(w,u,additive_identity)
| product(w,u,v) ),
inference(res,[status(thm),theory(equality)],[7,80]),
[iquote('0:Res:7.0,80.0')] ).
cnf(832,plain,
( ~ product(u,v,additive_identity)
| product(u,v,multiply(additive_identity,v)) ),
inference(res,[status(thm),theory(equality)],[3,481]),
[iquote('0:Res:3.0,481.0')] ).
cnf(860,plain,
( ~ product(inverse(u),u,additive_identity)
| equal(multiply(additive_identity,u),additive_identity) ),
inference(res,[status(thm),theory(equality)],[832,43]),
[iquote('0:Res:832.1,43.0')] ).
cnf(869,plain,
equal(multiply(additive_identity,u),additive_identity),
inference(mrr,[status(thm)],[860,20]),
[iquote('0:MRR:860.0,20.0')] ).
cnf(892,plain,
product(additive_identity,u,additive_identity),
inference(spr,[status(thm),theory(equality)],[869,3]),
[iquote('0:SpR:869.0,3.0')] ).
cnf(900,plain,
$false,
inference(unc,[status(thm)],[892,25]),
[iquote('0:UnC:892.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 1 19:55:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.39/0.58
% 0.39/0.58 SPASS V 3.9
% 0.39/0.58 SPASS beiseite: Proof found.
% 0.39/0.58 % SZS status Theorem
% 0.39/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.58 SPASS derived 752 clauses, backtracked 0 clauses, performed 0 splits and kept 315 clauses.
% 0.39/0.58 SPASS allocated 63721 KBytes.
% 0.39/0.58 SPASS spent 0:00:00.22 on the problem.
% 0.39/0.58 0:00:00.04 for the input.
% 0.39/0.58 0:00:00.00 for the FLOTTER CNF translation.
% 0.39/0.58 0:00:00.01 for inferences.
% 0.39/0.58 0:00:00.00 for the backtracking.
% 0.39/0.58 0:00:00.14 for the reduction.
% 0.39/0.58
% 0.39/0.58
% 0.39/0.58 Here is a proof with depth 5, length 17 :
% 0.39/0.58 % SZS output start Refutation
% See solution above
% 0.39/0.58 Formulae used in the proof : prove_equations closure_of_multiplication commutativity_of_multiplication additive_identity1 additive_identity2 distributivity4 multiplicative_inverse1 multiplication_is_well_defined
% 0.39/0.58
%------------------------------------------------------------------------------