TSTP Solution File: SYN311-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN311-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 26 ( 0 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 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,x)
| p(x,u,v,w) ),
file('SYN311-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(u,v,w,x)
| p(x,w,v,u) ),
file('SYN311-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(u,v,w,x)
| p(u,v,w,g(x)) ),
file('SYN311-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(u,v,w,x)
| p(f(u),v,w,x) ),
file('SYN311-1.p',unknown),
[] ).
cnf(5,axiom,
p(a,b,c,d),
file('SYN311-1.p',unknown),
[] ).
cnf(6,axiom,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
file('SYN311-1.p',unknown),
[] ).
cnf(9,plain,
p(d,a,b,c),
inference(res,[status(thm),theory(equality)],[5,1]),
[iquote('0:Res:5.0,1.0')] ).
cnf(11,plain,
( ~ p(u,v,w,x)
| p(x,f(u),v,w) ),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.1,1.0')] ).
cnf(12,plain,
( ~ p(u,v,w,x)
| p(x,w,v,f(u)) ),
inference(res,[status(thm),theory(equality)],[4,2]),
[iquote('0:Res:4.1,2.0')] ).
cnf(21,plain,
( ~ p(u,v,w,x)
| p(g(x),u,v,w) ),
inference(res,[status(thm),theory(equality)],[3,1]),
[iquote('0:Res:3.1,1.0')] ).
cnf(31,plain,
~ p(g(d),f(g(c)),f(g(b)),f(g(a))),
inference(res,[status(thm),theory(equality)],[4,6]),
[iquote('0:Res:4.1,6.0')] ).
cnf(44,plain,
~ p(g(a),f(g(b)),f(g(c)),g(d)),
inference(res,[status(thm),theory(equality)],[12,31]),
[iquote('0:Res:12.1,31.0')] ).
cnf(50,plain,
~ p(g(a),f(g(b)),f(g(c)),d),
inference(res,[status(thm),theory(equality)],[3,44]),
[iquote('0:Res:3.1,44.0')] ).
cnf(56,plain,
~ p(g(b),f(g(c)),d,g(a)),
inference(res,[status(thm),theory(equality)],[11,50]),
[iquote('0:Res:11.1,50.0')] ).
cnf(61,plain,
~ p(g(b),f(g(c)),d,a),
inference(res,[status(thm),theory(equality)],[3,56]),
[iquote('0:Res:3.1,56.0')] ).
cnf(65,plain,
~ p(g(c),d,a,g(b)),
inference(res,[status(thm),theory(equality)],[11,61]),
[iquote('0:Res:11.1,61.0')] ).
cnf(74,plain,
~ p(g(c),d,a,b),
inference(res,[status(thm),theory(equality)],[3,65]),
[iquote('0:Res:3.1,65.0')] ).
cnf(77,plain,
~ p(d,a,b,c),
inference(res,[status(thm),theory(equality)],[21,74]),
[iquote('0:Res:21.1,74.0')] ).
cnf(79,plain,
$false,
inference(mrr,[status(thm)],[77,9]),
[iquote('0:MRR:77.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN311-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n013.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 14:50:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.39
% 0.13/0.39 SPASS V 3.9
% 0.13/0.39 SPASS beiseite: Proof found.
% 0.13/0.39 % SZS status Theorem
% 0.13/0.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 SPASS derived 72 clauses, backtracked 0 clauses, performed 0 splits and kept 65 clauses.
% 0.13/0.39 SPASS allocated 63145 KBytes.
% 0.13/0.39 SPASS spent 0:00:00.04 on the problem.
% 0.13/0.39 0:00:00.02 for the input.
% 0.13/0.39 0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.39 0:00:00.00 for inferences.
% 0.13/0.39 0:00:00.00 for the backtracking.
% 0.13/0.39 0:00:00.00 for the reduction.
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Here is a proof with depth 8, length 19 :
% 0.13/0.39 % SZS output start Refutation
% See solution above
% 0.13/0.39 Formulae used in the proof : clause1 clause2 clause3 clause4 clause5 clause6
% 0.13/0.39
%------------------------------------------------------------------------------