TSTP Solution File: SWW951+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n023.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 21 00:46:43 EDT 2022
% Result : Theorem 0.22s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 5 16:33:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.40 % SZS status Theorem
% 0.22/0.40 % SZS output begin IncompleteProof
% 0.22/0.40 cnf(c0, axiom,
% 0.22/0.40 ~pred_attacker(name_objective)).
% 0.22/0.40 cnf(c1, plain,
% 0.22/0.40 ~pred_attacker(name_objective),
% 0.22/0.40 inference(start, [], [c0])).
% 0.22/0.40
% 0.22/0.40 cnf(c2, axiom,
% 0.22/0.40 pred_attacker(X0) | ~pred_attacker(tuple_T_out_4(X0))).
% 0.22/0.40 cnf(a0, assumption,
% 0.22/0.40 name_objective = X0).
% 0.22/0.40 cnf(c3, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.40 cnf(c4, plain,
% 0.22/0.40 ~pred_attacker(tuple_T_out_4(X0)),
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.40
% 0.22/0.40 cnf(c5, axiom,
% 0.22/0.40 pred_attacker(tuple_T_out_4(name_objective)) | ~pred_attacker(tuple_T_in_1(X1)) | ~pred_attacker(tuple_T_in_3(X2))).
% 0.22/0.40 cnf(a1, assumption,
% 0.22/0.40 tuple_T_out_4(X0) = tuple_T_out_4(name_objective)).
% 0.22/0.40 cnf(c6, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.22/0.40 cnf(c7, plain,
% 0.22/0.40 ~pred_attacker(tuple_T_in_1(X1)) | ~pred_attacker(tuple_T_in_3(X2)),
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.22/0.40
% 0.22/0.40 cnf(c8, axiom,
% 0.22/0.40 pred_attacker(tuple_T_in_1(X3)) | ~pred_attacker(X3)).
% 0.22/0.40 cnf(a2, assumption,
% 0.22/0.40 tuple_T_in_1(X1) = tuple_T_in_1(X3)).
% 0.22/0.40 cnf(c9, plain,
% 0.22/0.40 ~pred_attacker(tuple_T_in_3(X2)),
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.22/0.40 cnf(c10, plain,
% 0.22/0.40 ~pred_attacker(X3),
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.22/0.40
% 0.22/0.40 cnf(c11, axiom,
% 0.22/0.40 pred_attacker(tuple_true)).
% 0.22/0.40 cnf(a3, assumption,
% 0.22/0.40 X3 = tuple_true).
% 0.22/0.40 cnf(c12, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.22/0.40 cnf(c13, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.22/0.40
% 0.22/0.40 cnf(c14, axiom,
% 0.22/0.40 pred_attacker(tuple_T_in_3(X4)) | ~pred_attacker(X4)).
% 0.22/0.40 cnf(a4, assumption,
% 0.22/0.40 tuple_T_in_3(X2) = tuple_T_in_3(X4)).
% 0.22/0.40 cnf(c15, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 0.22/0.40 cnf(c16, plain,
% 0.22/0.40 ~pred_attacker(X4),
% 0.22/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 0.22/0.40
% 0.22/0.40 cnf(c17, plain,
% 0.22/0.40 pred_attacker(X3)).
% 0.22/0.40 cnf(a5, assumption,
% 0.22/0.40 X4 = X3).
% 0.22/0.40 cnf(c18, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(predicate_reduction, [assumptions([a5])], [c16, c17])).
% 0.22/0.40
% 0.22/0.40 cnf(c19, plain,
% 0.22/0.40 $false,
% 0.22/0.40 inference(constraint_solving, [
% 0.22/0.40 bind(X0, name_objective),
% 0.22/0.40 bind(X1, tuple_true),
% 0.22/0.40 bind(X2, tuple_true),
% 0.22/0.40 bind(X3, tuple_true),
% 0.22/0.40 bind(X4, tuple_true)
% 0.22/0.40 ],
% 0.22/0.40 [a0, a1, a2, a3, a4, a5])).
% 0.22/0.40
% 0.22/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------