TSTP Solution File: SYN347+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN347+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:36 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 9 unt; 6 nHn; 20 RR)
% Number of literals : 35 ( 0 equ; 15 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( big(skc2,skf1(u,v))
| big(skc3,skf1(u,v)) ),
file('SYN347+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big(skc2,skf1(u,v))
| ~ big(skc3,skf1(u,v)) ),
file('SYN347+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big(u,skf1(v,u))
| big(v,skf1(v,u))
| big(skc3,skc2) ),
file('SYN347+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big(u,skf1(u,v))
| big(v,skf1(u,v))
| big(skc3,skc2) ),
file('SYN347+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big(skc3,skc2)
| big(u,skf1(u,v))
| big(v,skf1(u,v)) ),
file('SYN347+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big(u,skf1(u,v))
| ~ big(v,skf1(u,v))
| ~ big(skc3,skc2) ),
file('SYN347+1.p',unknown),
[] ).
cnf(7,plain,
big(skc3,skc2),
inference(spt,[spt(split,[position(s1)])],[4]),
[iquote('1:Spt:4.2')] ).
cnf(8,plain,
( big(u,skf1(u,v))
| big(v,skf1(u,v)) ),
inference(mrr,[status(thm)],[5,7]),
[iquote('1:MRR:5.0,7.0')] ).
cnf(9,plain,
( ~ big(u,skf1(u,v))
| ~ big(v,skf1(u,v)) ),
inference(mrr,[status(thm)],[6,7]),
[iquote('1:MRR:6.2,7.0')] ).
cnf(10,plain,
big(u,skf1(u,u)),
inference(fac,[status(thm)],[8]),
[iquote('1:Fac:8.0,8.1')] ).
cnf(17,plain,
~ big(u,skf1(u,u)),
inference(res,[status(thm),theory(equality)],[10,9]),
[iquote('1:Res:10.0,9.0')] ).
cnf(18,plain,
$false,
inference(mrr,[status(thm)],[17,10]),
[iquote('1:MRR:17.0,10.0')] ).
cnf(19,plain,
~ big(skc3,skc2),
inference(spt,[spt(split,[position(sa)])],[18,7]),
[iquote('1:Spt:18.0,4.2,7.0')] ).
cnf(20,plain,
( ~ big(u,skf1(u,v))
| big(v,skf1(u,v)) ),
inference(spt,[spt(split,[position(s2)])],[4]),
[iquote('1:Spt:18.0,4.0,4.1')] ).
cnf(21,plain,
( ~ big(u,skf1(v,u))
| big(v,skf1(v,u)) ),
inference(mrr,[status(thm)],[3,19]),
[iquote('1:MRR:3.2,19.0')] ).
cnf(22,plain,
( big(skc3,skf1(skc2,u))
| big(u,skf1(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[1,20]),
[iquote('1:Res:1.0,20.0')] ).
cnf(23,plain,
big(skc3,skf1(skc2,skc3)),
inference(fac,[status(thm)],[22]),
[iquote('1:Fac:22.0,22.1')] ).
cnf(28,plain,
big(skc2,skf1(skc2,skc3)),
inference(res,[status(thm),theory(equality)],[23,21]),
[iquote('1:Res:23.0,21.0')] ).
cnf(33,plain,
~ big(skc3,skf1(skc2,skc3)),
inference(res,[status(thm),theory(equality)],[28,2]),
[iquote('1:Res:28.0,2.0')] ).
cnf(35,plain,
$false,
inference(mrr,[status(thm)],[33,23]),
[iquote('1:MRR:33.0,23.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN347+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n015.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 21:00:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 24 clauses, backtracked 5 clauses, performed 1 splits and kept 24 clauses.
% 0.19/0.44 SPASS allocated 85184 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 5, length 20 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : church_46_17_3
% 0.19/0.44
%------------------------------------------------------------------------------