TSTP Solution File: GEO232+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO232+1 : TPTP v8.1.0. Bugfixed v6.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 : n008.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 05:00:14 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO232+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 12:57:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 line(sK5)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 line(sK5),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 unequally_directed_lines(X0,reverse_line(X1)) | unequally_directed_lines(X0,X1) | ~line(X1) | ~line(X0)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 sK5 = X1).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 unequally_directed_lines(X0,reverse_line(X1)) | unequally_directed_lines(X0,X1) | ~line(X0),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~unequally_directed_lines(sK5,reverse_line(sK5))).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X0 = sK5).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 reverse_line(X1) = reverse_line(sK5)).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 unequally_directed_lines(X0,X1) | ~line(X0),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 ~unequally_directed_lines(X2,X2)).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X0 = X2).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X1 = X2).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~line(X0),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, plain,
% 0.13/0.35 line(sK5)).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X0 = sK5).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a5])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK5),
% 0.13/0.35 bind(X1, sK5),
% 0.13/0.35 bind(X2, sK5)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------