TSTP Solution File: SYN028-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN028-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:20 EDT 2022
% Result : Unsatisfiable 0.17s 0.40s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 1 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( q
| p ),
file('SYN028-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ q
| r ),
file('SYN028-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ r
| s ),
file('SYN028-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ s
| ~ r
| t ),
file('SYN028-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ t
| p ),
file('SYN028-1.p',unknown),
[] ).
cnf(6,axiom,
~ p,
file('SYN028-1.p',unknown),
[] ).
cnf(7,plain,
q,
inference(mrr,[status(thm)],[1,6]),
[iquote('0:MRR:1.1,6.0')] ).
cnf(8,plain,
~ t,
inference(mrr,[status(thm)],[5,6]),
[iquote('0:MRR:5.1,6.0')] ).
cnf(9,plain,
r,
inference(mrr,[status(thm)],[2,7]),
[iquote('0:MRR:2.0,7.0')] ).
cnf(10,plain,
s,
inference(mrr,[status(thm)],[3,9]),
[iquote('0:MRR:3.0,9.0')] ).
cnf(11,plain,
$false,
inference(mrr,[status(thm)],[4,10,9,8]),
[iquote('0:MRR:4.0,4.1,4.2,10.0,9.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN028-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n014.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 04:37:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.40
% 0.17/0.40 SPASS V 3.9
% 0.17/0.40 SPASS beiseite: Proof found.
% 0.17/0.40 % SZS status Theorem
% 0.17/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.40 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 7 clauses.
% 0.17/0.40 SPASS allocated 63075 KBytes.
% 0.17/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.17/0.40 0:00:00.04 for the input.
% 0.17/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.40 0:00:00.00 for inferences.
% 0.17/0.40 0:00:00.00 for the backtracking.
% 0.17/0.40 0:00:00.00 for the reduction.
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 Here is a proof with depth 0, length 11 :
% 0.17/0.40 % SZS output start Refutation
% See solution above
% 0.17/0.40 Formulae used in the proof : clause1 clause2 clause3 clause4 clause5 prove_something
% 0.17/0.40
%------------------------------------------------------------------------------