TSTP Solution File: SET836-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET836-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 : 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 : Tue Jul 19 02:48:31 EDT 2022
% Result : Unsatisfiable 0.24s 0.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET836-1 : TPTP v8.1.0. Released v3.2.0.
% 0.14/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jul 9 17:48:17 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.24/0.44 % SZS status Unsatisfiable
% 0.24/0.44 % SZS output begin IncompleteProof
% 0.24/0.44 cnf(c0, axiom,
% 0.24/0.44 c_lessequals(v_Z,v_X,tc_set(t_a))).
% 0.24/0.44 cnf(c1, plain,
% 0.24/0.44 c_lessequals(v_Z,v_X,tc_set(t_a)),
% 0.24/0.44 inference(start, [], [c0])).
% 0.24/0.44
% 0.24/0.44 cnf(c2, axiom,
% 0.24/0.44 c_in(X0,X1,X2) | ~c_lessequals(X3,X1,tc_set(X2)) | ~c_in(X0,X3,X2)).
% 0.24/0.44 cnf(a0, assumption,
% 0.24/0.44 v_Z = X3).
% 0.24/0.44 cnf(a1, assumption,
% 0.24/0.44 v_X = X1).
% 0.24/0.44 cnf(a2, assumption,
% 0.24/0.44 tc_set(t_a) = tc_set(X2)).
% 0.24/0.44 cnf(c3, plain,
% 0.24/0.44 $false,
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.24/0.44 cnf(c4, plain,
% 0.24/0.44 c_in(X0,X1,X2) | ~c_in(X0,X3,X2),
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.24/0.44
% 0.24/0.44 cnf(c5, axiom,
% 0.24/0.44 ~c_in(v_x,v_X,t_a)).
% 0.24/0.44 cnf(a3, assumption,
% 0.24/0.44 X0 = v_x).
% 0.24/0.44 cnf(a4, assumption,
% 0.24/0.44 X1 = v_X).
% 0.24/0.44 cnf(a5, assumption,
% 0.24/0.44 X2 = t_a).
% 0.24/0.44 cnf(c6, plain,
% 0.24/0.44 ~c_in(X0,X3,X2),
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.24/0.44 cnf(c7, plain,
% 0.24/0.44 $false,
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.24/0.44
% 0.24/0.44 cnf(c8, axiom,
% 0.24/0.44 c_in(v_x,v_Z,t_a)).
% 0.24/0.44 cnf(a6, assumption,
% 0.24/0.44 X0 = v_x).
% 0.24/0.44 cnf(a7, assumption,
% 0.24/0.44 X3 = v_Z).
% 0.24/0.44 cnf(a8, assumption,
% 0.24/0.44 X2 = t_a).
% 0.24/0.44 cnf(c9, plain,
% 0.24/0.44 $false,
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.24/0.44 cnf(c10, plain,
% 0.24/0.44 $false,
% 0.24/0.44 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.24/0.44
% 0.24/0.44 cnf(c11, plain,
% 0.24/0.44 $false,
% 0.24/0.44 inference(constraint_solving, [
% 0.24/0.44 bind(X0, v_x),
% 0.24/0.44 bind(X1, v_X),
% 0.24/0.44 bind(X2, t_a),
% 0.24/0.44 bind(X3, v_Z)
% 0.24/0.44 ],
% 0.24/0.44 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.24/0.44
% 0.24/0.44 % SZS output end IncompleteProof
%------------------------------------------------------------------------------