TSTP Solution File: SYN060+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN060+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:17:47 EDT 2022
% Result : Theorem 0.18s 0.42s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 4 unt; 1 nHn; 9 RR)
% Number of literals : 14 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 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_i(skc1),
file('SYN060+1.p',unknown),
[] ).
cnf(3,axiom,
( skP0(u)
| big_i(u) ),
file('SYN060+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ skP0(u)
| big(u) ),
file('SYN060+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ skP0(u)
| big_h(u) ),
file('SYN060+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big_h(u)
| ~ big(u) ),
file('SYN060+1.p',unknown),
[] ).
cnf(8,plain,
skP0(skc1),
inference(res,[status(thm),theory(equality)],[3,1]),
[iquote('0:Res:3.0,1.0')] ).
cnf(18,plain,
( ~ skP0(u)
| ~ skP0(u) ),
inference(ems,[status(thm)],[6,5,4]),
[iquote('0:EmS:6.0,6.1,5.1,4.1')] ).
cnf(19,plain,
~ skP0(u),
inference(obv,[status(thm),theory(equality)],[18]),
[iquote('0:Obv:18.0')] ).
cnf(20,plain,
$false,
inference(unc,[status(thm)],[19,8]),
[iquote('0:UnC:19.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN060+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 06:10:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.42
% 0.18/0.42 SPASS V 3.9
% 0.18/0.42 SPASS beiseite: Proof found.
% 0.18/0.42 % SZS status Theorem
% 0.18/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.42 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.18/0.42 SPASS allocated 97557 KBytes.
% 0.18/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.18/0.42 0:00:00.03 for the input.
% 0.18/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42 0:00:00.00 for inferences.
% 0.18/0.42 0:00:00.00 for the backtracking.
% 0.18/0.42 0:00:00.00 for the reduction.
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 Here is a proof with depth 1, length 9 :
% 0.18/0.42 % SZS output start Refutation
% See solution above
% 0.18/0.42 Formulae used in the proof : pel30 pel30_2 pel30_1
% 0.18/0.42
%------------------------------------------------------------------------------