TSTP Solution File: DAT085_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT085_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n004.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:09 EDT 2022
% Result : Theorem 25.76s 13.68s
% Output : Refutation 25.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT085_1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n004.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 : Fri Jul 1 17:17:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 25.76/13.68
% 25.76/13.68
% 25.76/13.68 % SZS status Theorem for /tmp/SPASST_20826_n004.cluster.edu
% 25.76/13.68
% 25.76/13.68 SPASS V 2.2.22 in combination with yices.
% 25.76/13.68 SPASS beiseite: Proof found by SPASS.
% 25.76/13.68 Problem: /tmp/SPASST_20826_n004.cluster.edu
% 25.76/13.68 SPASS derived 8094 clauses, backtracked 0 clauses and kept 4507 clauses.
% 25.76/13.68 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 25.76/13.68 SPASS allocated 25675 KBytes.
% 25.76/13.68 SPASS spent 0:00:12.63 on the problem.
% 25.76/13.68 0:00:00.00 for the input.
% 25.76/13.68 0:00:00.01 for the FLOTTER CNF translation.
% 25.76/13.68 0:00:00.12 for inferences.
% 25.76/13.68 0:00:00.00 for the backtracking.
% 25.76/13.68 0:00:11.99 for the reduction.
% 25.76/13.68 0:00:00.22 for interacting with the SMT procedure.
% 25.76/13.68
% 25.76/13.68
% 25.76/13.68 % SZS output start CNFRefutation for /tmp/SPASST_20826_n004.cluster.edu
% 25.76/13.68
% 25.76/13.68 % Here is a proof with depth 4, length 16 :
% 25.76/13.68 7[0:Inp] || -> list(skf6(U,V))*.
% 25.76/13.68 13[0:Inp] || list(U) -> list(cons(V,U))*.
% 25.76/13.68 17[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 25.76/13.68 22[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**.
% 25.76/13.68 29[0:Inp] || list(U) list(V) equal(length(U),length(V))* -> equal(U,V).
% 25.76/13.68 67[0:ArS:22.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**.
% 25.76/13.68 225[0:SpL:67.1,29.2] || list(U) list(V) list(cons(W,U))* equal(length(V),plus(length(U),1))* -> equal(V,cons(W,U))*.
% 25.76/13.68 226[0:MRR:225.2,13.1] || list(U) list(V) equal(length(V),plus(length(U),1))*+ -> equal(V,cons(W,U))*.
% 25.76/13.68 1295[0:SpL:67.1,226.2] || list(U) list(V) list(cons(W,U))* equal(plus(length(U),1),plus(length(V),1))* -> equal(cons(W,U),cons(X,V))*.
% 25.76/13.68 1303[0:MRR:1295.2,13.1] || list(U) list(V) equal(plus(length(U),1),plus(length(V),1))*+ -> equal(cons(W,U),cons(X,V))*.
% 25.76/13.68 8537[0:EqR:1303.2] || list(U) list(U) -> equal(cons(V,U),cons(W,U))*.
% 25.76/13.68 8546[0:Obv:8537.0] || list(U) -> equal(cons(V,U),cons(W,U))*.
% 25.76/13.68 18228[0:SpR:8546.1,17.1] || list(U) list(U) -> equal(head(cons(V,U)),W)*.
% 25.76/13.68 18710[0:BLD:18228.2] || list(U)* list(U)* -> .
% 25.76/13.68 18711[0:Obv:18710.0] || list(U)* -> .
% 25.76/13.68 18712(e)[0:UnC:18711.0,7.0] || -> .
% 25.76/13.68
% 25.76/13.68 % SZS output end CNFRefutation for /tmp/SPASST_20826_n004.cluster.edu
% 25.76/13.68
% 25.76/13.68 Formulae used in the proof : fof_l fof_tail_type fof_l2 fof_a_8 fof_in_conv fof_nil_type
% 30.23/16.51
% 30.23/16.51 SPASS+T ended
%------------------------------------------------------------------------------