TSTP Solution File: SYN332+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN332+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:24 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 4 unt; 8 nHn; 22 RR)
% Number of literals : 44 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ skP0(u,v,w)
| big(w,v) ),
file('SYN332+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ skP0(u,v,w)
| big(v,w) ),
file('SYN332+1.p',unknown),
[] ).
cnf(5,axiom,
( big(u,skf1(u,v))
| skP0(skf1(u,v),v,u) ),
file('SYN332+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u,skf1(u,v))
| big(skf1(u,v),u) ),
file('SYN332+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ big(u,skf1(u,v))
| big(v,skf1(u,v)) ),
file('SYN332+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ big(skf1(u,v),v)
| big(v,u)
| big(u,v) ),
file('SYN332+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ big(u,v)
| ~ big(v,u)
| ~ big(skf1(v,u),u) ),
file('SYN332+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ big(u,v)
| ~ big(skf1(v,u),skf1(v,u))
| big(v,u) ),
file('SYN332+1.p',unknown),
[] ).
cnf(18,plain,
( big(u,skf1(u,v))
| big(u,v) ),
inference(res,[status(thm),theory(equality)],[5,1]),
[iquote('0:Res:5.1,1.0')] ).
cnf(19,plain,
( big(u,skf1(u,v))
| big(v,u) ),
inference(res,[status(thm),theory(equality)],[5,2]),
[iquote('0:Res:5.1,2.0')] ).
cnf(21,plain,
( big(u,v)
| big(v,skf1(u,v)) ),
inference(res,[status(thm),theory(equality)],[18,8]),
[iquote('0:Res:18.0,8.0')] ).
cnf(23,plain,
( big(u,v)
| big(u,skf1(v,u)) ),
inference(res,[status(thm),theory(equality)],[19,8]),
[iquote('0:Res:19.0,8.0')] ).
cnf(32,plain,
( ~ big(u,skf1(u,u))
| big(u,u)
| big(u,u) ),
inference(res,[status(thm),theory(equality)],[6,13]),
[iquote('0:Res:6.1,13.0')] ).
cnf(34,plain,
( ~ big(u,skf1(u,u))
| big(u,u) ),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.1')] ).
cnf(35,plain,
big(u,u),
inference(mrr,[status(thm)],[34,21]),
[iquote('0:MRR:34.0,21.1')] ).
cnf(36,plain,
( ~ big(u,v)
| big(v,u) ),
inference(mrr,[status(thm)],[16,35]),
[iquote('0:MRR:16.1,35.0')] ).
cnf(38,plain,
( ~ big(skf1(u,v),v)
| big(u,v) ),
inference(mrr,[status(thm)],[13,36]),
[iquote('0:MRR:13.1,36.0')] ).
cnf(39,plain,
( ~ big(u,v)
| ~ big(skf1(u,v),v) ),
inference(mrr,[status(thm)],[15,36]),
[iquote('0:MRR:15.0,36.1')] ).
cnf(43,plain,
~ big(skf1(u,v),v),
inference(mrr,[status(thm)],[39,38]),
[iquote('0:MRR:39.0,38.1')] ).
cnf(46,plain,
( big(u,v)
| big(skf1(v,u),u) ),
inference(res,[status(thm),theory(equality)],[23,36]),
[iquote('0:Res:23.1,36.0')] ).
cnf(49,plain,
big(u,v),
inference(mrr,[status(thm)],[46,43]),
[iquote('0:MRR:46.1,43.0')] ).
cnf(50,plain,
$false,
inference(unc,[status(thm)],[49,43]),
[iquote('0:UnC:49.0,43.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN332+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 04:40:04 EDT 2022
% 0.12/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 29 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.20/0.43 SPASS allocated 85097 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.43 0:00:00.04 for the input.
% 0.20/0.43 0:00:00.03 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 22 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : church_46_14_4
% 0.20/0.43
%------------------------------------------------------------------------------