TSTP Solution File: SYN070-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN070-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:18 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 7 unt; 10 nHn; 26 RR)
% Number of literals : 66 ( 0 equ; 32 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big(u)
| big_g(u)
| big(f(u)) ),
file('SYN070-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big(u)
| big_g(u)
| big_h(f(u),u) ),
file('SYN070-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big(u)
| ~ big_g(f(u))
| big_g(u) ),
file('SYN070-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big(u)
| big_g(u)
| big(a) ),
file('SYN070-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(u)
| ~ big_g(a)
| big_g(u) ),
file('SYN070-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u)
| ~ big(v)
| big_g(u)
| big_g(v)
| big_j(a,v) ),
file('SYN070-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big(u)
| ~ big(v)
| ~ big_j(u,v)
| ~ big_h(v,u) ),
file('SYN070-1.p',unknown),
[] ).
cnf(8,axiom,
big(b),
file('SYN070-1.p',unknown),
[] ).
cnf(9,axiom,
~ big_g(b),
file('SYN070-1.p',unknown),
[] ).
cnf(10,plain,
( ~ big(u)
| big_g(u)
| big_j(a,u) ),
inference(con,[status(thm)],[6]),
[iquote('0:Con:6.0')] ).
cnf(16,plain,
( ~ big_g(a)
| big_g(b) ),
inference(res,[status(thm),theory(equality)],[8,5]),
[iquote('0:Res:8.0,5.0')] ).
cnf(17,plain,
( big_g(b)
| big(a) ),
inference(res,[status(thm),theory(equality)],[8,4]),
[iquote('0:Res:8.0,4.0')] ).
cnf(25,plain,
big(a),
inference(mrr,[status(thm)],[17,9]),
[iquote('0:MRR:17.0,9.0')] ).
cnf(28,plain,
~ big_g(a),
inference(mrr,[status(thm)],[16,9]),
[iquote('0:MRR:16.1,9.0')] ).
cnf(43,plain,
( ~ big(u)
| ~ big(a)
| ~ big(u)
| ~ big_h(u,a)
| big_g(u) ),
inference(res,[status(thm),theory(equality)],[10,7]),
[iquote('0:Res:10.2,7.2')] ).
cnf(44,plain,
( ~ big(a)
| ~ big(u)
| ~ big_h(u,a)
| big_g(u) ),
inference(obv,[status(thm),theory(equality)],[43]),
[iquote('0:Obv:43.0')] ).
cnf(45,plain,
( ~ big(u)
| ~ big_h(u,a)
| big_g(u) ),
inference(ssi,[status(thm)],[44,25]),
[iquote('0:SSi:44.0,25.0')] ).
cnf(46,plain,
( ~ big(a)
| ~ big(f(a))
| big_g(a)
| big_g(f(a)) ),
inference(res,[status(thm),theory(equality)],[2,45]),
[iquote('0:Res:2.2,45.1')] ).
cnf(47,plain,
( ~ big(f(a))
| big_g(a)
| big_g(f(a)) ),
inference(ssi,[status(thm)],[46,25]),
[iquote('0:SSi:46.0,25.0')] ).
cnf(48,plain,
( ~ big(f(a))
| big_g(f(a)) ),
inference(mrr,[status(thm)],[47,28]),
[iquote('0:MRR:47.1,28.0')] ).
cnf(49,plain,
( ~ big(a)
| big_g(f(a))
| big_g(a) ),
inference(sor,[status(thm)],[48,1]),
[iquote('0:SoR:48.0,1.2')] ).
cnf(50,plain,
( big_g(f(a))
| big_g(a) ),
inference(ssi,[status(thm)],[49,25]),
[iquote('0:SSi:49.0,25.0')] ).
cnf(51,plain,
big_g(f(a)),
inference(mrr,[status(thm)],[50,28]),
[iquote('0:MRR:50.1,28.0')] ).
cnf(52,plain,
( ~ big(a)
| big_g(a) ),
inference(res,[status(thm),theory(equality)],[51,3]),
[iquote('0:Res:51.0,3.1')] ).
cnf(53,plain,
big_g(a),
inference(ssi,[status(thm)],[52,25]),
[iquote('0:SSi:52.0,25.0')] ).
cnf(54,plain,
$false,
inference(mrr,[status(thm)],[53,28]),
[iquote('0:MRR:53.0,28.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN070-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 14:10:28 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.20/0.41 SPASS allocated 75611 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.04 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 4, length 26 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/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.20/0.41
%------------------------------------------------------------------------------