TSTP Solution File: DAT059_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT059_1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n017.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 : Sat Jul 16 01:32:01 EDT 2022
% Result : Theorem 0.43s 1.02s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
data(skc8),
file('DAT059=1.p',unknown),
[] ).
cnf(6,axiom,
array(skc7),
file('DAT059=1.p',unknown),
[] ).
cnf(7,axiom,
data(skc6),
file('DAT059=1.p',unknown),
[] ).
cnf(11,axiom,
~ equal(put(put(skc7,skc9,skc8),skc9,skc6),put(skc7,skc9,skc6)),
file('DAT059=1.p',unknown),
[] ).
cnf(15,axiom,
( ~ data(U)
| ~ array(V)
| ~ data(W)
| equal(put(put(V,X,U),X,W),put(V,X,W)) ),
file('DAT059=1.p',unknown),
[] ).
cnf(68,plain,
( ~ data(skc6)
| ~ array(skc7)
| ~ data(skc8) ),
inference(res,[status(thm),theory(equality)],[15,11]),
[iquote('0:Res:15.3,11.0')] ).
cnf(72,plain,
$false,
inference(mrr,[status(thm)],[68,7,6,5]),
[iquote('0:MRR:68.0,68.1,68.2,7.0,6.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT059_1 : TPTP v8.1.0. Released v5.5.0.
% 0.07/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.33 % Computer : n017.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 : Fri Jul 1 20:16:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.43/1.02
% 0.43/1.02
% 0.43/1.02 % SZS status Theorem for /tmp/SPASST_1397_n017.cluster.edu
% 0.43/1.02
% 0.43/1.02 SPASS V 2.2.22 in combination with yices.
% 0.43/1.02 SPASS beiseite: Proof found by SPASS.
% 0.43/1.02 Problem: /tmp/SPASST_1397_n017.cluster.edu
% 0.43/1.02 SPASS derived 20 clauses, backtracked 0 clauses and kept 52 clauses.
% 0.43/1.02 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.43/1.02 SPASS allocated 6315 KBytes.
% 0.43/1.02 SPASS spent 0:00:00.01 on the problem.
% 0.43/1.02 0:00:00.00 for the input.
% 0.43/1.02 0:00:00.01 for the FLOTTER CNF translation.
% 0.43/1.02 0:00:00.00 for inferences.
% 0.43/1.02 0:00:00.00 for the backtracking.
% 0.43/1.02 0:00:00.00 for the reduction.
% 0.43/1.02 0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.02
% 0.43/1.02
% 0.43/1.02 % SZS output start CNFRefutation for /tmp/SPASST_1397_n017.cluster.edu
% See solution above
% 0.43/1.02
% 0.43/1.02 Formulae used in the proof : fof_data_type fof_th_lem_5 fof_put_type fof_ax_19
% 0.43/1.04
% 0.43/1.04 SPASS+T ended
%------------------------------------------------------------------------------