TSTP Solution File: FLD025-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD025-2 : TPTP v8.1.0. Bugfixed v2.1.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 : Sat Jul 16 02:28:21 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD025-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 02:41:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48
% 0.21/0.48 SPASS V 3.9
% 0.21/0.48 SPASS beiseite: Proof found.
% 0.21/0.48 % SZS status Theorem
% 0.21/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 SPASS derived 290 clauses, backtracked 0 clauses, performed 0 splits and kept 233 clauses.
% 0.21/0.48 SPASS allocated 76036 KBytes.
% 0.21/0.48 SPASS spent 0:00:00.11 on the problem.
% 0.21/0.48 0:00:00.03 for the input.
% 0.21/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.48 0:00:00.01 for inferences.
% 0.21/0.48 0:00:00.00 for the backtracking.
% 0.21/0.48 0:00:00.05 for the reduction.
% 0.21/0.48
% 0.21/0.48
% 0.21/0.48 Here is a proof with depth 5, length 23 :
% 0.21/0.48 % SZS output start Refutation
% 0.21/0.48 2[0:Inp] || -> defined(b)*.
% 0.21/0.48 3[0:Inp] || -> defined(c)*.
% 0.21/0.48 7[0:Inp] || -> equalish(a,b)*l.
% 0.21/0.48 8[0:Inp] || -> equalish(c,d)*l.
% 0.21/0.48 9[0:Inp] || -> equalish(multiply(a,c),u__dfg)*l.
% 0.21/0.48 10[0:Inp] || -> equalish(multiply(d,b),v__dfg)*l.
% 0.21/0.48 11[0:Inp] || equalish(v__dfg,u__dfg)*r -> .
% 0.21/0.48 19[0:Inp] defined(u) defined(v) || -> equalish(multiply(v,u),multiply(u,v))*.
% 0.21/0.48 33[0:Inp] || equalish(u,v)* -> equalish(v,u).
% 0.21/0.48 34[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*.
% 0.21/0.48 36[0:Inp] defined(u) || equalish(v,w) -> equalish(multiply(v,u),multiply(w,u))*.
% 0.21/0.48 40[0:Res:8.0,36.1] defined(u) || -> equalish(multiply(c,u),multiply(d,u))*l.
% 0.21/0.48 44[0:Res:7.0,36.1] defined(u) || -> equalish(multiply(a,u),multiply(b,u))*l.
% 0.21/0.48 47[0:Res:33.1,11.0] || equalish(u__dfg,v__dfg)*l -> .
% 0.21/0.48 53[0:Res:9.0,33.0] || -> equalish(u__dfg,multiply(a,c))*r.
% 0.21/0.48 73[0:OCh:34.1,34.0,44.1,53.0] defined(c) || -> equalish(u__dfg,multiply(b,c))*r.
% 0.21/0.48 74[0:SSi:73.0,3.0] || -> equalish(u__dfg,multiply(b,c))*r.
% 0.21/0.48 125[0:OCh:34.1,34.0,19.2,74.0] defined(c) defined(b) || -> equalish(u__dfg,multiply(c,b))*r.
% 0.21/0.48 136[0:SSi:125.1,125.0,2.0,3.0] || -> equalish(u__dfg,multiply(c,b))*r.
% 0.21/0.48 440[0:OCh:34.1,34.0,40.1,136.0] defined(b) || -> equalish(u__dfg,multiply(d,b))*r.
% 0.21/0.48 446[0:SSi:440.0,2.0] || -> equalish(u__dfg,multiply(d,b))*r.
% 0.21/0.48 467[0:OCh:34.1,34.0,446.0,10.0] || -> equalish(u__dfg,v__dfg)*l.
% 0.21/0.48 470[0:MRR:467.0,47.0] || -> .
% 0.21/0.48 % SZS output end Refutation
% 0.21/0.48 Formulae used in the proof : b_is_defined c_is_defined a_equals_b_7 c_equals_d_8 multiply_equals_u_9 multiply_equals_v_10 v_not_equal_to_u_11 commutativity_multiplication symmetry_of_equality transitivity_of_equality compatibility_of_equality_and_multiplication
% 0.21/0.48
%------------------------------------------------------------------------------