TSTP Solution File: SYN196-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN196-1 : TPTP v8.1.0. Released v1.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:19:22 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ s1(a),
file('SYN196-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN196-1.p',unknown),
[] ).
cnf(18,axiom,
q0(u,d),
file('SYN196-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN196-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN196-1.p',unknown),
[] ).
cnf(419,plain,
( ~ s1(u)
| ~ q0(a,v) ),
inference(res,[status(thm),theory(equality)],[165,1]),
[iquote('0:Res:165.2,1.0')] ).
cnf(453,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(470,plain,
~ q0(a,u),
inference(ems,[status(thm)],[419,453]),
[iquote('0:EmS:419.0,453.0')] ).
cnf(471,plain,
$false,
inference(unc,[status(thm)],[470,18]),
[iquote('0:UnC:470.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN196-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n015.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 12 05:59:55 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 350 clauses.
% 0.18/0.45 SPASS allocated 76109 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.45 0:00:00.05 for the input.
% 0.18/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.03 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 2, length 9 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : prove_this axiom_14 axiom_17 rule_125 rule_126
% 0.18/0.45
%------------------------------------------------------------------------------