TSTP Solution File: SYN006-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:09 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 8 unt; 2 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p1(u,f(v))
| q1(f(u),v)
| q2(u,f(v)) ),
file('SYN006-1.p',unknown),
[] ).
cnf(2,axiom,
p1(a,u),
file('SYN006-1.p',unknown),
[] ).
cnf(3,axiom,
~ q2(u,f(v)),
file('SYN006-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p2(u,f(v))
| q4(u,f(v))
| q3(f(u),v) ),
file('SYN006-1.p',unknown),
[] ).
cnf(5,axiom,
~ q3(u,g(v)),
file('SYN006-1.p',unknown),
[] ).
cnf(6,axiom,
~ q4(f(f(u)),f(g(f(v)))),
file('SYN006-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ q1(u,f(v))
| p2(f(u),v) ),
file('SYN006-1.p',unknown),
[] ).
cnf(8,plain,
( ~ p1(u,f(v))
| q1(f(u),v) ),
inference(mrr,[status(thm)],[1,3]),
[iquote('0:MRR:1.2,3.0')] ).
cnf(9,plain,
( ~ p2(f(f(u)),f(g(f(v))))
| q3(f(f(f(u))),g(f(v))) ),
inference(res,[status(thm),theory(equality)],[4,6]),
[iquote('0:Res:4.1,6.0')] ).
cnf(10,plain,
~ p2(f(f(u)),f(g(f(v)))),
inference(mrr,[status(thm)],[9,5]),
[iquote('0:MRR:9.1,5.0')] ).
cnf(11,plain,
~ q1(f(u),f(f(g(f(v))))),
inference(res,[status(thm),theory(equality)],[7,10]),
[iquote('0:Res:7.1,10.0')] ).
cnf(12,plain,
~ p1(u,f(f(f(g(f(v)))))),
inference(res,[status(thm),theory(equality)],[8,11]),
[iquote('0:Res:8.1,11.0')] ).
cnf(13,plain,
$false,
inference(unc,[status(thm)],[12,2]),
[iquote('0:UnC:12.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n023.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 : Tue Jul 12 06:10:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.40
% 0.13/0.40 SPASS V 3.9
% 0.13/0.40 SPASS beiseite: Proof found.
% 0.13/0.40 % SZS status Theorem
% 0.13/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.13/0.40 SPASS allocated 63089 KBytes.
% 0.13/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.13/0.40 0:00:00.03 for the input.
% 0.13/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.40 0:00:00.00 for inferences.
% 0.13/0.40 0:00:00.00 for the backtracking.
% 0.13/0.40 0:00:00.00 for the reduction.
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Here is a proof with depth 3, length 13 :
% 0.13/0.40 % SZS output start Refutation
% See solution above
% 0.13/0.40 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 clause_6 clause_7
% 0.13/0.40
%------------------------------------------------------------------------------