%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:21:02 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 4 unt; 7 nHn; 15 RR)
% Number of literals : 34 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( p1
| p2
| skC0 ),
file('SYN392+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ p1
| p2
| skC0 ),
file('SYN392+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p2
| p1
| skC0 ),
file('SYN392+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ skC0
| p2
| p1 ),
file('SYN392+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p1
| ~ skC0
| p2 ),
file('SYN392+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ p2
| ~ skC0
| p1 ),
file('SYN392+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ p1
| ~ p2
| skC0 ),
file('SYN392+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ p1
| ~ p2
| ~ skC0 ),
file('SYN392+1.p',unknown),
[] ).
cnf(9,plain,
( p2
| p1 ),
inference(mrr,[status(thm)],[4,1]),
[iquote('0:MRR:4.0,1.2')] ).
cnf(10,plain,
( p1
| skC0 ),
inference(mrr,[status(thm)],[3,9]),
[iquote('0:MRR:3.0,9.0')] ).
cnf(11,plain,
( p2
| skC0 ),
inference(mrr,[status(thm)],[2,10]),
[iquote('0:MRR:2.0,10.0')] ).
cnf(12,plain,
skC0,
inference(mrr,[status(thm)],[7,10,11]),
[iquote('0:MRR:7.0,7.1,10.0,11.0')] ).
cnf(13,plain,
p1,
inference(mrr,[status(thm)],[6,9,12]),
[iquote('0:MRR:6.0,6.1,9.0,12.0')] ).
cnf(14,plain,
p2,
inference(mrr,[status(thm)],[5,13,12]),
[iquote('0:MRR:5.0,5.1,13.0,12.0')] ).
cnf(15,plain,
$false,
inference(mrr,[status(thm)],[8,13,14,12]),
[iquote('0:MRR:8.0,8.1,8.2,13.0,14.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.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 17:21:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 8 clauses.
% 0.18/0.44 SPASS allocated 85056 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 0, length 15 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : pel14
% 0.18/0.44
%------------------------------------------------------------------------------