TSTP Solution File: SYO691-1.000 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 19:55:35 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 6 unt; 0 nHn; 19 RR)
% Number of literals : 38 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
top(f(f(u,v),f(w,a)),f(f(w,f(v,a)),u)),
file('SYO691-1.000.p',unknown),
[] ).
cnf(2,axiom,
( ~ top(u,v)
| step__dfg(u,v) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(3,axiom,
( ~ step__dfg(u,v)
| step__dfg(f(u,w),f(v,w)) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(4,axiom,
( ~ step__dfg(u,v)
| step__dfg(f(w,u),f(w,v)) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(5,axiom,
seq(zero,u,u),
file('SYO691-1.000.p',unknown),
[] ).
cnf(6,axiom,
( ~ step__dfg(u,v)
| ~ seq(w,x,u)
| seq(succ(w),x,v) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(7,axiom,
~ seq(succ(succ(succ(zero))),u,u),
file('SYO691-1.000.p',unknown),
[] ).
cnf(8,plain,
( ~ step__dfg(u,v)
| ~ seq(succ(succ(zero)),v,u) ),
inference(res,[status(thm),theory(equality)],[6,7]),
[iquote('0:Res:6.2,7.0')] ).
cnf(9,plain,
( ~ step__dfg(u,v)
| seq(succ(zero),u,v) ),
inference(res,[status(thm),theory(equality)],[5,6]),
[iquote('0:Res:5.0,6.1')] ).
cnf(10,plain,
( ~ step__dfg(u,v)
| ~ step__dfg(v,w)
| seq(succ(succ(zero)),u,w) ),
inference(res,[status(thm),theory(equality)],[9,6]),
[iquote('0:Res:9.1,6.1')] ).
cnf(12,plain,
( ~ step__dfg(u,v)
| ~ step__dfg(f(w,v),x)
| seq(succ(succ(zero)),f(w,u),x) ),
inference(res,[status(thm),theory(equality)],[4,10]),
[iquote('0:Res:4.1,10.0')] ).
cnf(17,plain,
( ~ step__dfg(u,v)
| ~ step__dfg(w,x)
| seq(succ(succ(zero)),f(u,w),f(v,x)) ),
inference(res,[status(thm),theory(equality)],[3,12]),
[iquote('0:Res:3.1,12.1')] ).
cnf(25,plain,
( ~ step__dfg(u,v)
| ~ step__dfg(w,x)
| ~ step__dfg(f(v,x),f(u,w)) ),
inference(res,[status(thm),theory(equality)],[17,8]),
[iquote('0:Res:17.2,8.1')] ).
cnf(27,plain,
( ~ top(f(u,v),f(w,x))
| ~ step__dfg(w,u)
| ~ step__dfg(x,v) ),
inference(res,[status(thm),theory(equality)],[2,25]),
[iquote('0:Res:2.1,25.2')] ).
cnf(36,plain,
( ~ step__dfg(f(u,f(v,a)),f(w,v))
| ~ step__dfg(w,f(u,a)) ),
inference(res,[status(thm),theory(equality)],[1,27]),
[iquote('0:Res:1.0,27.0')] ).
cnf(37,plain,
( ~ top(f(u,f(v,a)),f(w,v))
| ~ step__dfg(w,f(u,a)) ),
inference(res,[status(thm),theory(equality)],[2,36]),
[iquote('0:Res:2.1,36.0')] ).
cnf(44,plain,
~ step__dfg(f(u,f(v,a)),f(f(u,v),a)),
inference(res,[status(thm),theory(equality)],[1,37]),
[iquote('0:Res:1.0,37.0')] ).
cnf(45,plain,
~ top(f(u,f(v,a)),f(f(u,v),a)),
inference(res,[status(thm),theory(equality)],[2,44]),
[iquote('0:Res:2.1,44.0')] ).
cnf(46,plain,
$false,
inference(unc,[status(thm)],[45,1]),
[iquote('0:UnC:45.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.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 : Fri Jul 8 19:11:16 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 36 clauses, backtracked 0 clauses, performed 0 splits and kept 38 clauses.
% 0.19/0.42 SPASS allocated 63144 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.06 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.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 10, length 19 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : rule_1 rewrite_top rewrite_left rewrite_right rewrite_sequence_zero rewrite_sequence_succ prove
% 0.19/0.42
%------------------------------------------------------------------------------