TSTP Solution File: SYN349+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:37 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 5 unt; 12 nHn; 26 RR)
% Number of literals : 70 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( big(u,v)
| big(w,u)
| skP0(v,u,w) ),
file('SYN349+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big(u,skf3(u,v))
| big(skf2(u),skf3(u,v)) ),
file('SYN349+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big(skf2(u),skf3(u,v))
| big(u,skf3(u,v)) ),
file('SYN349+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big(u,v)
| ~ skP0(w,v,u)
| big(v,w) ),
file('SYN349+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(u,v)
| ~ skP0(v,u,w)
| big(w,u) ),
file('SYN349+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u,v)
| ~ big(w,u)
| skP0(v,u,w) ),
file('SYN349+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ skP0(u,skf3(v,u),v)
| big(u,skf3(v,u))
| big(skf3(v,u),skf2(v)) ),
file('SYN349+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ big(u,skf3(v,u))
| big(skf3(v,u),skf2(v))
| skP0(u,skf3(v,u),v) ),
file('SYN349+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ big(skf3(u,v),skf2(u))
| big(v,skf3(u,v))
| skP0(v,skf3(u,v),u) ),
file('SYN349+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ big(u,skf3(v,u))
| ~ big(skf3(v,u),skf2(v))
| ~ skP0(u,skf3(v,u),v) ),
file('SYN349+1.p',unknown),
[] ).
cnf(17,plain,
( ~ big(u,skf3(v,u))
| ~ big(v,skf3(v,u))
| big(skf3(v,u),skf2(v))
| big(skf3(v,u),u) ),
inference(res,[status(thm),theory(equality)],[8,4]),
[iquote('0:Res:8.2,4.1')] ).
cnf(18,plain,
( ~ big(skf3(u,v),skf2(u))
| ~ big(skf3(u,v),v)
| big(v,skf3(u,v))
| big(u,skf3(u,v)) ),
inference(res,[status(thm),theory(equality)],[9,5]),
[iquote('0:Res:9.2,5.1')] ).
cnf(21,plain,
( big(skf3(u,v),v)
| big(u,skf3(u,v))
| big(v,skf3(u,v))
| big(skf3(u,v),skf2(u)) ),
inference(res,[status(thm),theory(equality)],[1,7]),
[iquote('0:Res:1.2,7.0')] ).
cnf(24,plain,
( ~ big(skf3(u,v),v)
| ~ big(u,skf3(u,v))
| ~ big(v,skf3(u,v))
| ~ big(skf3(u,v),skf2(u)) ),
inference(res,[status(thm),theory(equality)],[6,10]),
[iquote('0:Res:6.2,10.2')] ).
cnf(28,plain,
( big(u,skf3(u,skf2(u)))
| big(skf2(u),skf3(u,skf2(u)))
| big(skf3(u,skf2(u)),skf2(u)) ),
inference(fac,[status(thm)],[21]),
[iquote('0:Fac:21.0,21.3')] ).
cnf(29,plain,
( big(skf2(u),skf3(u,skf2(u)))
| big(skf3(u,skf2(u)),skf2(u)) ),
inference(mrr,[status(thm)],[28,2]),
[iquote('0:MRR:28.0,2.0')] ).
cnf(30,plain,
( ~ big(u,skf3(u,skf2(u)))
| ~ big(u,skf3(u,skf2(u)))
| big(skf3(u,skf2(u)),skf2(u))
| big(skf3(u,skf2(u)),skf2(u)) ),
inference(res,[status(thm),theory(equality)],[2,17]),
[iquote('0:Res:2.1,17.0')] ).
cnf(31,plain,
( ~ big(u,skf3(u,skf2(u)))
| big(skf3(u,skf2(u)),skf2(u)) ),
inference(obv,[status(thm),theory(equality)],[30]),
[iquote('0:Obv:30.2')] ).
cnf(40,plain,
( ~ big(skf3(u,skf2(u)),skf2(u))
| big(skf2(u),skf3(u,skf2(u)))
| big(skf2(u),skf3(u,skf2(u)))
| big(u,skf3(u,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[29,18]),
[iquote('0:Res:29.1,18.0')] ).
cnf(41,plain,
( ~ big(skf3(u,skf2(u)),skf2(u))
| big(skf2(u),skf3(u,skf2(u)))
| big(u,skf3(u,skf2(u))) ),
inference(obv,[status(thm),theory(equality)],[40]),
[iquote('0:Obv:40.1')] ).
cnf(42,plain,
big(u,skf3(u,skf2(u))),
inference(mrr,[status(thm)],[41,29,3]),
[iquote('0:MRR:41.0,41.1,29.1,3.0')] ).
cnf(43,plain,
big(skf3(u,skf2(u)),skf2(u)),
inference(mrr,[status(thm)],[31,42]),
[iquote('0:MRR:31.0,42.0')] ).
cnf(51,plain,
( ~ big(skf3(u,skf2(u)),skf2(u))
| ~ big(u,skf3(u,skf2(u)))
| ~ big(skf2(u),skf3(u,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[43,24]),
[iquote('0:Res:43.0,24.3')] ).
cnf(52,plain,
~ big(skf2(u),skf3(u,skf2(u))),
inference(mrr,[status(thm)],[51,43,42]),
[iquote('0:MRR:51.0,51.1,43.0,42.0')] ).
cnf(53,plain,
~ big(u,skf3(u,skf2(u))),
inference(res,[status(thm),theory(equality)],[2,52]),
[iquote('0:Res:2.1,52.0')] ).
cnf(54,plain,
$false,
inference(mrr,[status(thm)],[53,42]),
[iquote('0:MRR:53.0,42.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 19:30:49 EDT 2022
% 0.13/0.34 % 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 36 clauses, backtracked 0 clauses, performed 0 splits and kept 24 clauses.
% 0.20/0.44 SPASS allocated 85280 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 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 4, length 26 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : church_46_17_5
% 0.20/0.44
%------------------------------------------------------------------------------