TSTP Solution File: SYN045+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN045+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:32 EDT 2022
% Result : Theorem 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 5 unt; 8 nHn; 17 RR)
% Number of literals : 35 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( p
| q
| skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(2,axiom,
( p
| r
| skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p
| skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p
| ~ skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ skC0
| q
| p ),
file('SYN045+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ skC0
| r
| p ),
file('SYN045+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ q
| ~ r
| skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ r
| ~ q
| ~ skC0 ),
file('SYN045+1.p',unknown),
[] ).
cnf(9,plain,
( r
| skC0 ),
inference(mrr,[status(thm)],[2,3]),
[iquote('0:MRR:2.0,3.0')] ).
cnf(10,plain,
( q
| skC0 ),
inference(mrr,[status(thm)],[1,3]),
[iquote('0:MRR:1.0,3.0')] ).
cnf(11,plain,
( r
| p ),
inference(mrr,[status(thm)],[6,9]),
[iquote('0:MRR:6.0,9.1')] ).
cnf(12,plain,
( q
| p ),
inference(mrr,[status(thm)],[5,10]),
[iquote('0:MRR:5.0,10.1')] ).
cnf(13,plain,
~ p,
inference(mrr,[status(thm)],[4,3]),
[iquote('0:MRR:4.1,3.1')] ).
cnf(14,plain,
r,
inference(mrr,[status(thm)],[11,13]),
[iquote('0:MRR:11.1,13.0')] ).
cnf(15,plain,
q,
inference(mrr,[status(thm)],[12,13]),
[iquote('0:MRR:12.1,13.0')] ).
cnf(16,plain,
skC0,
inference(mrr,[status(thm)],[7,15,14]),
[iquote('0:MRR:7.0,7.1,15.0,14.0')] ).
cnf(17,plain,
$false,
inference(mrr,[status(thm)],[8,14,15,16]),
[iquote('0:MRR:8.0,8.1,8.2,14.0,15.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN045+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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 : Mon Jul 11 19:47:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.19/0.42 SPASS allocated 85056 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 0, length 17 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : pel13
% 0.19/0.42
%------------------------------------------------------------------------------