TSTP Solution File: SYN312-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:20:09 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 30 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(u,v,w)
| ~ p(x,u,w)
| p(x,v,w) ),
file('SYN312-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(u,v,w)
| p(w,v,u) ),
file('SYN312-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(u,v,w)
| p(v,u,w) ),
file('SYN312-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(u,v,w)
| p(u,v,f(w)) ),
file('SYN312-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(u,v,w)
| p(g(u),v,w) ),
file('SYN312-1.p',unknown),
[] ).
cnf(6,axiom,
p(a,f(b),c),
file('SYN312-1.p',unknown),
[] ).
cnf(7,axiom,
p(f(b),d,c),
file('SYN312-1.p',unknown),
[] ).
cnf(8,axiom,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('SYN312-1.p',unknown),
[] ).
cnf(23,plain,
( ~ p(u,v,w)
| p(w,v,g(u)) ),
inference(res,[status(thm),theory(equality)],[5,2]),
[iquote('0:Res:5.1,2.0')] ).
cnf(34,plain,
( ~ p(u,v,w)
| p(v,u,f(w)) ),
inference(res,[status(thm),theory(equality)],[4,3]),
[iquote('0:Res:4.1,3.0')] ).
cnf(43,plain,
~ p(f(g(a)),f(g(d)),g(c)),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.1,8.0')] ).
cnf(45,plain,
~ p(c,f(g(d)),f(g(a))),
inference(res,[status(thm),theory(equality)],[23,43]),
[iquote('0:Res:23.1,43.0')] ).
cnf(49,plain,
( ~ p(u,f(b),c)
| p(u,d,c) ),
inference(res,[status(thm),theory(equality)],[7,1]),
[iquote('0:Res:7.0,1.0')] ).
cnf(71,plain,
p(a,d,c),
inference(res,[status(thm),theory(equality)],[6,49]),
[iquote('0:Res:6.0,49.0')] ).
cnf(76,plain,
p(c,d,a),
inference(res,[status(thm),theory(equality)],[71,2]),
[iquote('0:Res:71.0,2.0')] ).
cnf(83,plain,
p(d,c,a),
inference(res,[status(thm),theory(equality)],[76,3]),
[iquote('0:Res:76.0,3.0')] ).
cnf(106,plain,
~ p(f(g(d)),c,g(a)),
inference(res,[status(thm),theory(equality)],[34,45]),
[iquote('0:Res:34.1,45.0')] ).
cnf(111,plain,
~ p(a,c,f(g(d))),
inference(res,[status(thm),theory(equality)],[23,106]),
[iquote('0:Res:23.1,106.0')] ).
cnf(113,plain,
~ p(a,c,g(d)),
inference(res,[status(thm),theory(equality)],[4,111]),
[iquote('0:Res:4.1,111.0')] ).
cnf(115,plain,
~ p(d,c,a),
inference(res,[status(thm),theory(equality)],[23,113]),
[iquote('0:Res:23.1,113.0')] ).
cnf(116,plain,
$false,
inference(mrr,[status(thm)],[115,83]),
[iquote('0:MRR:115.0,83.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.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 13:31:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 107 clauses, backtracked 0 clauses, performed 0 splits and kept 83 clauses.
% 0.19/0.42 SPASS allocated 63159 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.04 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 6, length 21 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8
% 0.19/0.42
%------------------------------------------------------------------------------