TSTP Solution File: SYN354+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN354+1 : TPTP v8.1.0. Released v2.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:20:41 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 3 unt; 4 nHn; 11 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
big(skc3,skc2),
file('SYN354+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(u,v)
| ~ big(skc3,u)
| ~ big(skc2,u) ),
file('SYN354+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u,v)
| big_g(v,skf1(u,v))
| big(skc2,v)
| big_g(skc2,skf1(u,v)) ),
file('SYN354+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big(u,v)
| ~ big_g(v,skf1(u,v))
| ~ big_g(skc2,skf1(u,v))
| big(skc2,v) ),
file('SYN354+1.p',unknown),
[] ).
cnf(9,plain,
( big_g(skc2,skf1(skc3,skc2))
| big(skc2,skc2)
| big_g(skc2,skf1(skc3,skc2)) ),
inference(res,[status(thm),theory(equality)],[2,6]),
[iquote('0:Res:2.0,6.0')] ).
cnf(10,plain,
( big(skc2,skc2)
| big_g(skc2,skf1(skc3,skc2)) ),
inference(obv,[status(thm),theory(equality)],[9]),
[iquote('0:Obv:9.0')] ).
cnf(13,plain,
( ~ big(skc3,skc2)
| ~ big_g(skc2,skf1(skc3,skc2))
| big(skc2,skc2)
| big(skc2,skc2) ),
inference(res,[status(thm),theory(equality)],[10,7]),
[iquote('0:Res:10.1,7.1')] ).
cnf(14,plain,
( ~ big(skc3,skc2)
| ~ big_g(skc2,skf1(skc3,skc2))
| big(skc2,skc2) ),
inference(obv,[status(thm),theory(equality)],[13]),
[iquote('0:Obv:13.2')] ).
cnf(15,plain,
big(skc2,skc2),
inference(mrr,[status(thm)],[14,2,10]),
[iquote('0:MRR:14.0,14.1,2.0,10.1')] ).
cnf(17,plain,
( ~ big(skc3,skc2)
| ~ big(skc2,skc2) ),
inference(res,[status(thm),theory(equality)],[15,5]),
[iquote('0:Res:15.0,5.0')] ).
cnf(18,plain,
$false,
inference(mrr,[status(thm)],[17,2,15]),
[iquote('0:MRR:17.0,17.1,2.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN354+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.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 : Tue Jul 12 07:23:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.43
% 0.20/0.43 SPASS V 3.9
% 0.20/0.43 SPASS beiseite: Proof found.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.20/0.43 SPASS allocated 85070 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.43 0:00:00.03 for the input.
% 0.20/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.43 0:00:00.00 for inferences.
% 0.20/0.43 0:00:00.00 for the backtracking.
% 0.20/0.43 0:00:00.00 for the reduction.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Here is a proof with depth 3, length 11 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : church_46_20_1
% 0.20/0.43
%------------------------------------------------------------------------------