%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN325+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:18 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 3 unt; 4 nHn; 9 RR)
% Number of literals : 15 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ big_g(skf1(u)),
file('SYN325+1.p',unknown),
[] ).
cnf(2,axiom,
( skP0(u,v)
| big(v,v) ),
file('SYN325+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ skP0(skf1(u),u)
| big_g(u) ),
file('SYN325+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big(u,u)
| skP0(u,v) ),
file('SYN325+1.p',unknown),
[] ).
cnf(6,plain,
( big(u,u)
| big_g(u) ),
inference(res,[status(thm),theory(equality)],[2,3]),
[iquote('0:Res:2.0,3.0')] ).
cnf(8,plain,
( big_g(u)
| skP0(u,v) ),
inference(res,[status(thm),theory(equality)],[6,4]),
[iquote('0:Res:6.0,4.0')] ).
cnf(9,plain,
( big_g(skf1(u))
| big_g(u) ),
inference(res,[status(thm),theory(equality)],[8,3]),
[iquote('0:Res:8.1,3.0')] ).
cnf(10,plain,
big_g(u),
inference(mrr,[status(thm)],[9,1]),
[iquote('0:MRR:9.0,1.0')] ).
cnf(11,plain,
$false,
inference(unc,[status(thm)],[10,1]),
[iquote('0:UnC:10.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN325+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 18:15:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.43 SPASS allocated 85055 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.03 for the input.
% 0.19/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 3, length 9 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : church_46_9_2
% 0.19/0.43
%------------------------------------------------------------------------------