TSTP Solution File: SYN069-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN069-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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 21 12:18:17 EDT 2022
% Result : Unsatisfiable 0.13s 0.41s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 9 unt; 7 nHn; 26 RR)
% Number of literals : 66 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_g(u)
| ~ big(v)
| ~ big_h(v,u)
| big_k(u)
| big_g(f(v)) ),
file('SYN069-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_g(u)
| ~ big(v)
| ~ big_h(v,u)
| big_k(u)
| big_h(v,f(v)) ),
file('SYN069-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_g(u)
| ~ big(v)
| ~ big_h(v,u)
| ~ big_j(v,f(v))
| big_k(u) ),
file('SYN069-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_k(u)
| ~ big_l(u) ),
file('SYN069-1.p',unknown),
[] ).
cnf(5,axiom,
big(a),
file('SYN069-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big_h(a,u)
| big_l(u) ),
file('SYN069-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big_g(u)
| ~ big_h(a,u)
| big_j(a,u) ),
file('SYN069-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ big(u)
| big_g(g(u)) ),
file('SYN069-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ big(u)
| big_h(u,g(u)) ),
file('SYN069-1.p',unknown),
[] ).
cnf(10,plain,
big_g(g(a)),
inference(res,[status(thm),theory(equality)],[5,8]),
[iquote('0:Res:5.0,8.0')] ).
cnf(11,plain,
big_h(a,g(a)),
inference(res,[status(thm),theory(equality)],[5,9]),
[iquote('0:Res:5.0,9.0')] ).
cnf(20,plain,
big_l(g(a)),
inference(res,[status(thm),theory(equality)],[11,6]),
[iquote('0:Res:11.0,6.0')] ).
cnf(22,plain,
( ~ big_g(g(a))
| ~ big(a)
| big_k(g(a))
| big_g(f(a)) ),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.0,1.2')] ).
cnf(24,plain,
( big_k(g(a))
| big_g(f(a)) ),
inference(ssi,[status(thm)],[22,5,10,20]),
[iquote('0:SSi:22.1,22.0,5.0,10.0,20.0')] ).
cnf(27,plain,
big_g(f(a)),
inference(ems,[status(thm)],[4,24,20]),
[iquote('0:EmS:4.0,4.1,24.0,20.0')] ).
cnf(29,plain,
( ~ big_g(g(a))
| ~ big(a)
| big_k(g(a))
| big_h(a,f(a)) ),
inference(res,[status(thm),theory(equality)],[11,2]),
[iquote('0:Res:11.0,2.2')] ).
cnf(31,plain,
( big_k(g(a))
| big_h(a,f(a)) ),
inference(ssi,[status(thm)],[29,5,10,20]),
[iquote('0:SSi:29.1,29.0,5.0,10.0,20.0')] ).
cnf(34,plain,
( ~ big_g(f(a))
| ~ big_g(u)
| ~ big(a)
| ~ big_h(a,f(a))
| ~ big_h(a,u)
| big_k(u) ),
inference(res,[status(thm),theory(equality)],[7,3]),
[iquote('0:Res:7.2,3.3')] ).
cnf(35,plain,
( ~ big_g(u)
| ~ big_h(a,f(a))
| ~ big_h(a,u)
| big_k(u) ),
inference(ssi,[status(thm)],[34,5,27]),
[iquote('0:SSi:34.2,34.0,5.0,27.0')] ).
cnf(44,plain,
( ~ big_g(u)
| ~ big_h(a,u)
| big_k(g(a))
| big_k(u) ),
inference(res,[status(thm),theory(equality)],[31,35]),
[iquote('0:Res:31.1,35.1')] ).
cnf(46,plain,
( ~ big_g(u)
| ~ big_h(a,u)
| big_k(u) ),
inference(spt,[spt(split,[position(s1)])],[44]),
[iquote('1:Spt:44.0,44.1,44.3')] ).
cnf(47,plain,
( ~ big_g(g(a))
| big_k(g(a)) ),
inference(res,[status(thm),theory(equality)],[11,46]),
[iquote('1:Res:11.0,46.1')] ).
cnf(51,plain,
big_k(g(a)),
inference(ssi,[status(thm)],[47,10,20]),
[iquote('1:SSi:47.0,10.0,20.0')] ).
cnf(52,plain,
$false,
inference(ems,[status(thm)],[4,51,20]),
[iquote('1:EmS:4.0,4.1,51.0,20.0')] ).
cnf(53,plain,
big_k(g(a)),
inference(spt,[spt(split,[position(s2)])],[44]),
[iquote('1:Spt:52.0,44.2')] ).
cnf(54,plain,
$false,
inference(ems,[status(thm)],[4,53,20]),
[iquote('1:EmS:4.0,4.1,53.0,20.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN069-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 20:13:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.41
% 0.13/0.41 SPASS V 3.9
% 0.13/0.41 SPASS beiseite: Proof found.
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41 SPASS derived 27 clauses, backtracked 3 clauses, performed 1 splits and kept 25 clauses.
% 0.13/0.41 SPASS allocated 75625 KBytes.
% 0.13/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.13/0.41 0:00:00.04 for the input.
% 0.13/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.41 0:00:00.00 for inferences.
% 0.13/0.41 0:00:00.00 for the backtracking.
% 0.13/0.41 0:00:00.00 for the reduction.
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Here is a proof with depth 6, length 26 :
% 0.13/0.41 % SZS output start Refutation
% See solution above
% 0.13/0.41 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 clause_6 clause_7 clause_8 clause_9
% 0.13/0.41
%------------------------------------------------------------------------------