TSTP Solution File: ANA013-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ANA013-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n012.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 14 19:08:30 EDT 2022
% Result : Unsatisfiable 1.79s 0.66s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA013-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.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 8 06:53:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.79/0.66 % SZS status Unsatisfiable
% 1.79/0.66 % SZS output begin IncompleteProof
% 1.79/0.66 cnf(c0, axiom,
% 1.79/0.66 class_Ring__and__Field_Oordered__idom(t_b)).
% 1.79/0.66 cnf(c1, plain,
% 1.79/0.66 class_Ring__and__Field_Oordered__idom(t_b),
% 1.79/0.66 inference(start, [], [c0])).
% 1.79/0.66
% 1.79/0.66 cnf(c2, axiom,
% 1.79/0.66 class_Orderings_Oorder(X0) | ~class_Ring__and__Field_Oordered__idom(X0)).
% 1.79/0.66 cnf(a0, assumption,
% 1.79/0.66 t_b = X0).
% 1.79/0.66 cnf(c3, plain,
% 1.79/0.66 $false,
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.79/0.66 cnf(c4, plain,
% 1.79/0.66 class_Orderings_Oorder(X0),
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.79/0.66
% 1.79/0.66 cnf(c5, axiom,
% 1.79/0.66 c_lessequals(X1,X1,X2) | ~class_Orderings_Oorder(X2)).
% 1.79/0.66 cnf(a1, assumption,
% 1.79/0.66 X0 = X2).
% 1.79/0.66 cnf(c6, plain,
% 1.79/0.66 $false,
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.79/0.66 cnf(c7, plain,
% 1.79/0.66 c_lessequals(X1,X1,X2),
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.79/0.66
% 1.79/0.66 cnf(c8, axiom,
% 1.79/0.66 ~c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(X3)),t_b),t_b),c_times(X3,c_HOL_Oabs(v_f(v_x(X3)),t_b),t_b),t_b)).
% 1.79/0.66 cnf(a2, assumption,
% 1.79/0.66 X1 = c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(X3)),t_b),t_b)).
% 1.79/0.66 cnf(a3, assumption,
% 1.79/0.66 X1 = c_times(X3,c_HOL_Oabs(v_f(v_x(X3)),t_b),t_b)).
% 1.79/0.66 cnf(a4, assumption,
% 1.79/0.66 X2 = t_b).
% 1.79/0.66 cnf(c9, plain,
% 1.79/0.66 $false,
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c7, c8])).
% 1.79/0.66 cnf(c10, plain,
% 1.79/0.66 $false,
% 1.79/0.66 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c7, c8])).
% 1.79/0.66
% 1.79/0.66 cnf(c11, plain,
% 1.79/0.66 $false,
% 1.79/0.66 inference(constraint_solving, [
% 1.79/0.66 bind(X0, t_b),
% 1.79/0.66 bind(X1, c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(X3)),t_b),t_b)),
% 1.79/0.66 bind(X2, t_b),
% 1.79/0.66 bind(X3, c_HOL_Oabs(v_c,t_b))
% 1.79/0.66 ],
% 1.79/0.66 [a0, a1, a2, a3, a4])).
% 1.79/0.66
% 1.79/0.66 % SZS output end IncompleteProof
%------------------------------------------------------------------------------