TSTP Solution File: SYN350+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN350+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:38 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 4 unt; 1 nHn; 8 RR)
% Number of literals : 13 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( big(u,skf1(v,u))
| big(skc1,skf1(v,u)) ),
file('SYN350+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big(skc1,skf1(u,v))
| big(skf1(u,v),skc1) ),
file('SYN350+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(u,v)
| ~ big(v,skf1(u,v))
| ~ big(skc1,skf1(u,v)) ),
file('SYN350+1.p',unknown),
[] ).
cnf(7,plain,
big(skc1,skf1(u,skc1)),
inference(fac,[status(thm)],[1]),
[iquote('0:Fac:1.0,1.1')] ).
cnf(16,plain,
( ~ big(u,skc1)
| ~ big(skc1,skf1(u,skc1)) ),
inference(res,[status(thm),theory(equality)],[7,5]),
[iquote('0:Res:7.0,5.1')] ).
cnf(18,plain,
~ big(u,skc1),
inference(mrr,[status(thm)],[16,7]),
[iquote('0:MRR:16.1,7.0')] ).
cnf(19,plain,
~ big(skc1,skf1(u,v)),
inference(mrr,[status(thm)],[2,18]),
[iquote('0:MRR:2.1,18.0')] ).
cnf(20,plain,
$false,
inference(unc,[status(thm)],[19,7]),
[iquote('0:UnC:19.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN350+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n003.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.35 % DateTime : Mon Jul 11 11:41:30 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.21/0.44 SPASS allocated 85068 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.44 0:00:00.03 for the input.
% 0.21/0.44 0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.00 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 2, length 8 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : church_46_18_2
% 0.21/0.44
%------------------------------------------------------------------------------