TSTP Solution File: LDA007-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 : Sun Jul 17 16:45:55 EDT 2022
% Result : Unsatisfiable 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 14 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(f(t,t),tt),
file('LDA007-1.p',unknown),
[] ).
cnf(3,axiom,
equal(f(t,s),ts),
file('LDA007-1.p',unknown),
[] ).
cnf(4,axiom,
equal(f(tt,ts),tt_ts),
file('LDA007-1.p',unknown),
[] ).
cnf(7,axiom,
equal(f(t,k),tk),
file('LDA007-1.p',unknown),
[] ).
cnf(9,axiom,
equal(f(ts,k),tsk),
file('LDA007-1.p',unknown),
[] ).
cnf(11,axiom,
~ equal(f(tt_ts,tk),f(t,tsk)),
file('LDA007-1.p',unknown),
[] ).
cnf(12,axiom,
equal(f(f(u,v),f(u,w)),f(u,f(v,w))),
file('LDA007-1.p',unknown),
[] ).
cnf(74,plain,
equal(f(f(t,u),tk),f(t,f(u,k))),
inference(spr,[status(thm),theory(equality)],[7,12]),
[iquote('0:SpR:7.0,12.0')] ).
cnf(77,plain,
equal(f(f(t,u),ts),f(t,f(u,s))),
inference(spr,[status(thm),theory(equality)],[3,12]),
[iquote('0:SpR:3.0,12.0')] ).
cnf(766,plain,
equal(f(t,f(t,s)),f(tt,ts)),
inference(spr,[status(thm),theory(equality)],[1,77]),
[iquote('0:SpR:1.0,77.0')] ).
cnf(768,plain,
equal(f(t,ts),tt_ts),
inference(rew,[status(thm),theory(equality)],[3,766,4]),
[iquote('0:Rew:3.0,766.0,4.0,766.0')] ).
cnf(776,plain,
equal(f(t,f(ts,k)),f(tt_ts,tk)),
inference(spr,[status(thm),theory(equality)],[768,74]),
[iquote('0:SpR:768.0,74.0')] ).
cnf(783,plain,
equal(f(tt_ts,tk),f(t,tsk)),
inference(rew,[status(thm),theory(equality)],[9,776]),
[iquote('0:Rew:9.0,776.0')] ).
cnf(784,plain,
$false,
inference(mrr,[status(thm)],[783,11]),
[iquote('0:MRR:783.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 03:44:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.52
% 0.18/0.52 SPASS V 3.9
% 0.18/0.52 SPASS beiseite: Proof found.
% 0.18/0.52 % SZS status Theorem
% 0.18/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.52 SPASS derived 628 clauses, backtracked 0 clauses, performed 0 splits and kept 482 clauses.
% 0.18/0.52 SPASS allocated 64023 KBytes.
% 0.18/0.52 SPASS spent 0:00:00.16 on the problem.
% 0.18/0.52 0:00:00.04 for the input.
% 0.18/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.52 0:00:00.01 for inferences.
% 0.18/0.52 0:00:00.00 for the backtracking.
% 0.18/0.52 0:00:00.10 for the reduction.
% 0.18/0.52
% 0.18/0.52
% 0.18/0.52 Here is a proof with depth 3, length 14 :
% 0.18/0.52 % SZS output start Refutation
% See solution above
% 0.18/0.52 Formulae used in the proof : clause_1 clause_3 clause_4 clause_7 clause_9 prove_equation a1
% 0.18/0.52
%------------------------------------------------------------------------------