%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:26 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 2 unt; 8 nHn; 19 RR)
% Number of literals : 42 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( big(u,v)
| big(skf1(v,u),skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(2,axiom,
( big_g(u,v)
| big_g(skf1(v,u),skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_g(skf1(u,v),skf1(u,v))
| big(v,u) ),
file('SYN334+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_g(u,v)
| ~ big_g(skf1(v,u),skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(u,v)
| ~ big(u,skf1(v,u))
| big_g(v,skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u,v)
| ~ big_g(v,skf1(v,u))
| big(u,skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big(u,v)
| ~ big(skf1(v,u),skf1(v,u))
| big_g(skf1(v,u),skf1(v,u)) ),
file('SYN334+1.p',unknown),
[] ).
cnf(8,plain,
( big_g(u,v)
| big(u,v) ),
inference(res,[status(thm),theory(equality)],[2,3]),
[iquote('0:Res:2.1,3.0')] ).
cnf(9,plain,
( ~ big(u,v)
| big_g(skf1(v,u),skf1(v,u)) ),
inference(mrr,[status(thm)],[7,8]),
[iquote('0:MRR:7.1,8.1')] ).
cnf(13,plain,
( ~ big(u,v)
| ~ big_g(u,v) ),
inference(res,[status(thm),theory(equality)],[9,4]),
[iquote('0:Res:9.1,4.1')] ).
cnf(16,plain,
( ~ big(u,v)
| ~ big(skf1(v,u),skf1(v,u)) ),
inference(res,[status(thm),theory(equality)],[9,13]),
[iquote('0:Res:9.1,13.1')] ).
cnf(22,plain,
( ~ big(u,v)
| big(v,skf1(v,u))
| big(u,skf1(v,u)) ),
inference(res,[status(thm),theory(equality)],[8,6]),
[iquote('0:Res:8.0,6.1')] ).
cnf(24,plain,
( big(u,v)
| big(skf1(v,u),skf1(skf1(v,u),skf1(v,u)))
| big(skf1(v,u),skf1(skf1(v,u),skf1(v,u))) ),
inference(res,[status(thm),theory(equality)],[1,22]),
[iquote('0:Res:1.1,22.0')] ).
cnf(25,plain,
( big(u,v)
| big(skf1(v,u),skf1(skf1(v,u),skf1(v,u))) ),
inference(obv,[status(thm),theory(equality)],[24]),
[iquote('0:Obv:24.1')] ).
cnf(28,plain,
( ~ big(skf1(u,v),skf1(u,v))
| big(v,u)
| big_g(skf1(u,v),skf1(skf1(u,v),skf1(u,v))) ),
inference(res,[status(thm),theory(equality)],[25,5]),
[iquote('0:Res:25.1,5.1')] ).
cnf(29,plain,
( big(u,v)
| big_g(skf1(v,u),skf1(skf1(v,u),skf1(v,u))) ),
inference(mrr,[status(thm)],[28,1]),
[iquote('0:MRR:28.0,1.1')] ).
cnf(33,plain,
( ~ big(skf1(u,v),skf1(skf1(u,v),skf1(u,v)))
| big(v,u) ),
inference(res,[status(thm),theory(equality)],[29,13]),
[iquote('0:Res:29.1,13.1')] ).
cnf(35,plain,
big(u,v),
inference(mrr,[status(thm)],[33,25]),
[iquote('0:MRR:33.0,25.1')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[16,35]),
[iquote('0:MRR:16.1,16.0,35.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n027.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.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Mon Jul 11 20:36:19 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 23 clauses.
% 0.20/0.44 SPASS allocated 85081 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 5, length 19 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : church_46_14_6
% 0.20/0.44
%------------------------------------------------------------------------------