TSTP Solution File: SYN047+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN047+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:34 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 33 ( 12 unt; 9 nHn; 33 RR)
% Number of literals : 68 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 7 ( 6 usr; 7 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( skC0
| skC1 ),
file('SYN047+1.p',unknown),
[] ).
cnf(2,axiom,
( p
| skC0 ),
file('SYN047+1.p',unknown),
[] ).
cnf(3,axiom,
( p
| skC1 ),
file('SYN047+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ s
| skC0 ),
file('SYN047+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ q
| skC1 ),
file('SYN047+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ s
| skC1 ),
file('SYN047+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ q
| r
| skC0 ),
file('SYN047+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ skC0
| ~ skC1
| p ),
file('SYN047+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ skC0
| ~ skC1
| r ),
file('SYN047+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ p
| ~ r
| s
| skC0 ),
file('SYN047+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ s
| ~ skC0
| ~ skC1 ),
file('SYN047+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ skC0
| ~ p
| q
| s ),
file('SYN047+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ skC1
| ~ p
| q
| s ),
file('SYN047+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ r
| ~ skC0
| ~ p
| s ),
file('SYN047+1.p',unknown),
[] ).
cnf(15,plain,
p,
inference(mrr,[status(thm)],[8,2,3]),
[iquote('0:MRR:8.0,8.1,2.1,3.1')] ).
cnf(16,plain,
( ~ skC1
| q
| s ),
inference(mrr,[status(thm)],[13,15]),
[iquote('0:MRR:13.1,15.0')] ).
cnf(17,plain,
( ~ skC0
| q
| s ),
inference(mrr,[status(thm)],[12,15]),
[iquote('0:MRR:12.1,15.0')] ).
cnf(18,plain,
~ s,
inference(mrr,[status(thm)],[11,4,6]),
[iquote('0:MRR:11.1,11.2,4.1,6.1')] ).
cnf(19,plain,
( ~ skC1
| q ),
inference(mrr,[status(thm)],[16,18]),
[iquote('0:MRR:16.2,18.0')] ).
cnf(20,plain,
( ~ skC0
| q ),
inference(mrr,[status(thm)],[17,18]),
[iquote('0:MRR:17.2,18.0')] ).
cnf(21,plain,
( ~ r
| skC0 ),
inference(mrr,[status(thm)],[10,15,18]),
[iquote('0:MRR:10.0,10.2,15.0,18.0')] ).
cnf(22,plain,
( ~ q
| skC0 ),
inference(mrr,[status(thm)],[7,21]),
[iquote('0:MRR:7.1,21.0')] ).
cnf(23,plain,
~ r,
inference(mrr,[status(thm)],[14,21,15,18]),
[iquote('0:MRR:14.1,14.2,14.3,21.1,15.0,18.0')] ).
cnf(24,plain,
( ~ skC1
| ~ skC0 ),
inference(mrr,[status(thm)],[9,23]),
[iquote('0:MRR:9.2,23.0')] ).
cnf(25,plain,
skC0,
inference(spt,[spt(split,[position(s1)])],[1]),
[iquote('1:Spt:1.0')] ).
cnf(26,plain,
q,
inference(mrr,[status(thm)],[20,25]),
[iquote('1:MRR:20.0,25.0')] ).
cnf(27,plain,
~ skC1,
inference(mrr,[status(thm)],[24,25]),
[iquote('1:MRR:24.1,25.0')] ).
cnf(28,plain,
skC1,
inference(mrr,[status(thm)],[5,26]),
[iquote('1:MRR:5.0,26.0')] ).
cnf(29,plain,
$false,
inference(mrr,[status(thm)],[27,28]),
[iquote('1:MRR:27.0,28.0')] ).
cnf(30,plain,
~ skC0,
inference(spt,[spt(split,[position(sa)])],[29,25]),
[iquote('1:Spt:29.0,1.0,25.0')] ).
cnf(31,plain,
skC1,
inference(spt,[spt(split,[position(s2)])],[1]),
[iquote('1:Spt:29.0,1.1')] ).
cnf(32,plain,
~ q,
inference(mrr,[status(thm)],[22,30]),
[iquote('1:MRR:22.1,30.0')] ).
cnf(33,plain,
$false,
inference(mrr,[status(thm)],[19,31,32]),
[iquote('1:MRR:19.0,19.1,31.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n021.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 : Tue Jul 12 07:17:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 8 clauses, backtracked 7 clauses, performed 1 splits and kept 26 clauses.
% 0.19/0.43 SPASS allocated 85065 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.04 for the input.
% 0.19/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 1, length 33 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : pel17
% 0.19/0.43
%------------------------------------------------------------------------------