TSTP Solution File: SYN066-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:52 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 1 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ big_p(f(u,v),g(u))
| big_q(h(u,v),g(u)) ),
file('SYN066-1.p',unknown),
[] ).
cnf(4,axiom,
( big_p(u,v)
| big_q(i(u,v),u) ),
file('SYN066-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big_q(u,v)
| big_r(w,w) ),
file('SYN066-1.p',unknown),
[] ).
cnf(6,axiom,
~ big_r(a,u),
file('SYN066-1.p',unknown),
[] ).
cnf(7,plain,
~ big_q(u,v),
inference(res,[status(thm),theory(equality)],[5,6]),
[iquote('0:Res:5.1,6.0')] ).
cnf(8,plain,
big_p(u,v),
inference(mrr,[status(thm)],[4,7]),
[iquote('0:MRR:4.1,7.0')] ).
cnf(9,plain,
~ big_p(f(u,v),g(u)),
inference(mrr,[status(thm)],[3,7]),
[iquote('0:MRR:3.1,7.0')] ).
cnf(10,plain,
$false,
inference(mrr,[status(thm)],[9,8]),
[iquote('0:MRR:9.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 23:59:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.40
% 0.20/0.40 SPASS V 3.9
% 0.20/0.40 SPASS beiseite: Proof found.
% 0.20/0.40 % SZS status Theorem
% 0.20/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.20/0.40 SPASS allocated 63082 KBytes.
% 0.20/0.40 SPASS spent 0:00:00.05 on the problem.
% 0.20/0.40 0:00:00.03 for the input.
% 0.20/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.40 0:00:00.00 for inferences.
% 0.20/0.40 0:00:00.00 for the backtracking.
% 0.20/0.40 0:00:00.00 for the reduction.
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Here is a proof with depth 1, length 8 :
% 0.20/0.40 % SZS output start Refutation
% See solution above
% 0.20/0.40 Formulae used in the proof : clause_3 clause_4 clause_5 clause_6
% 0.20/0.40
%------------------------------------------------------------------------------