TSTP Solution File: SYN355+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN355+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:42 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 1 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ big_p(skc1),
file('SYN355+1.p',unknown),
[] ).
cnf(2,axiom,
~ big_q(skc1),
file('SYN355+1.p',unknown),
[] ).
cnf(3,axiom,
( big_r(u)
| big_q(u) ),
file('SYN355+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_r(u)
| big_p(u) ),
file('SYN355+1.p',unknown),
[] ).
cnf(8,plain,
~ big_r(skc1),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.1,1.0')] ).
cnf(9,plain,
big_q(skc1),
inference(sor,[status(thm)],[8,3]),
[iquote('0:SoR:8.0,3.0')] ).
cnf(10,plain,
$false,
inference(mrr,[status(thm)],[9,2]),
[iquote('0:MRR:9.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN355+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 07:43:53 EDT 2022
% 0.14/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 6 clauses.
% 0.20/0.43 SPASS allocated 97550 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.43 0:00:00.03 for the input.
% 0.20/0.43 0:00:00.02 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 2, length 7 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : x2106
% 0.20/0.43
%------------------------------------------------------------------------------