TSTP Solution File: SYN954+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN954+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:32:17 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 4 unt; 2 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ q(u)
| p(u) ),
file('SYN954+1.p',unknown),
[] ).
cnf(2,axiom,
( p(u)
| skP0(v,u) ),
file('SYN954+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ skP0(skc2,u)
| q(u) ),
file('SYN954+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(u)
| skP0(u,v) ),
file('SYN954+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(skc3)
| ~ skP0(skc2,u) ),
file('SYN954+1.p',unknown),
[] ).
cnf(9,plain,
( p(u)
| q(u) ),
inference(res,[status(thm),theory(equality)],[2,3]),
[iquote('0:Res:2.1,3.0')] ).
cnf(10,plain,
p(u),
inference(mrr,[status(thm)],[9,1]),
[iquote('0:MRR:9.1,1.0')] ).
cnf(11,plain,
skP0(u,v),
inference(mrr,[status(thm)],[4,10]),
[iquote('0:MRR:4.0,10.0')] ).
cnf(12,plain,
~ skP0(skc2,u),
inference(mrr,[status(thm)],[5,10]),
[iquote('0:MRR:5.0,10.0')] ).
cnf(14,plain,
$false,
inference(mrr,[status(thm)],[12,11]),
[iquote('0:MRR:12.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN954+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 17:29:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.44 SPASS allocated 97554 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 1, length 10 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : prove_this
% 0.19/0.44
%------------------------------------------------------------------------------