TSTP Solution File: SYN374+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:52 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 5 unt; 1 nHn; 9 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_p(u)
| big_p(skc7) ),
file('SYN374+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_p(skc7)
| big_p(u) ),
file('SYN374+1.p',unknown),
[] ).
cnf(3,axiom,
( big_p(u)
| big_p(skc12)
| big_p(skf1(u)) ),
file('SYN374+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big_p(u)
| ~ big_p(skc13)
| ~ big_p(skf1(u)) ),
file('SYN374+1.p',unknown),
[] ).
cnf(15,plain,
big_p(u),
inference(spt,[spt(split,[position(s1)])],[2]),
[iquote('1:Spt:2.1')] ).
cnf(16,plain,
$false,
inference(mrr,[status(thm)],[6,15]),
[iquote('1:MRR:6.1,6.2,6.0,15.0')] ).
cnf(17,plain,
~ big_p(skc7),
inference(spt,[spt(split,[position(s2)])],[2]),
[iquote('1:Spt:16.0,2.0')] ).
cnf(18,plain,
~ big_p(u),
inference(mrr,[status(thm)],[1,17]),
[iquote('1:MRR:1.1,17.0')] ).
cnf(19,plain,
$false,
inference(mrr,[status(thm)],[3,18]),
[iquote('1:MRR:3.0,3.1,3.2,18.0,18.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 16:22:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 2 clauses, backtracked 6 clauses, performed 1 splits and kept 11 clauses.
% 0.21/0.44 SPASS allocated 97717 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.44 0:00:00.03 for the input.
% 0.21/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.00 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 1, length 9 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : x2125
% 0.21/0.44
%------------------------------------------------------------------------------