%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO076-4 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 20.0s
% Output : Assurance 20.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/GEO/GEO076-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 2 31)
% (binary-unit 9 #f 2 31)
% (binary-double 9 #f 2 31)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 31)
% (binary-order 25 #f 2 31)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(34,40,1,68,0,1,593,50,5,627,0,5,175342,4,1960,187067,5,2406,187067,1,2406,187067,50,2406,187067,40,2406,187101,0,2406,192517,50,2743,192551,0,2743)
%
%
% START OF PROOF
% 192519 [] on(X,line_from_to(X,Y)) | equal(X,Y) | -point(X) | -point(Y).
% 192520 [] on(X,line_from_to(Y,X)) | equal(Y,X) | -point(Y) | -point(X).
% 192521 [] line(line_from_to(X,Y)) | equal(X,Y) | -point(X) | -point(Y).
% 192522 [] -on(Z,U) | -on(X,U) | -on(Z,Y) | -on(X,Y) | equal(Y,U) | equal(X,Z) | -line(Y) | -line(U) | -point(Z) | -point(X).
% 192523 [] on(point_1_on_line(X),X) | -line(X).
% 192524 [] on(point_2_on_line(X),X) | -line(X).
% 192525 [] point(point_1_on_line(X)) | -line(X).
% 192526 [] point(point_2_on_line(X)) | -line(X).
% 192527 [] -equal(point_1_on_line(X),point_2_on_line(X)) | -line(X).
% 192528 [] -on(point_not_on_line(X),X) | -line(X).
% 192529 [] point(point_not_on_line(X)) | -line(X).
% 192530 [] line(at_least_one_line).
% 192550 [] point(a_point).
% 192551 [] on(a_point,X) | -line(X).
% 192558 [binary:192530,192525.2] point(point_1_on_line(at_least_one_line)).
% 192560 [binary:192530,192551.2] on(a_point,at_least_one_line).
% 192562 [binary:192530,192526.2] point(point_2_on_line(at_least_one_line)).
% 192564 [binary:192530,192529.2] point(point_not_on_line(at_least_one_line)).
% 192573 [binary:192564,192519.4] on(X,line_from_to(X,point_not_on_line(at_least_one_line))) | equal(X,point_not_on_line(at_least_one_line)) | -point(X).
% 192577 [binary:192530,192523.2] on(point_1_on_line(at_least_one_line),at_least_one_line).
% 192579 [binary:192530,192524.2] on(point_2_on_line(at_least_one_line),at_least_one_line).
% 192583 [binary:192558,192520.3] on(X,line_from_to(point_1_on_line(at_least_one_line),X)) | equal(point_1_on_line(at_least_one_line),X) | -point(X).
% 192590 [binary:192530,192528.2] -on(point_not_on_line(at_least_one_line),at_least_one_line).
% 192600 [binary:192558,192521.3] line(line_from_to(point_1_on_line(at_least_one_line),X)) | equal(point_1_on_line(at_least_one_line),X) | -point(X).
% 192602 [binary:192562,192521.3] line(line_from_to(point_2_on_line(at_least_one_line),X)) | equal(point_2_on_line(at_least_one_line),X) | -point(X).
% 192624 [binary:192560,192522,cut:192530,cut:192550,binarycut:192551] -on(X,at_least_one_line) | equal(Y,at_least_one_line) | equal(X,a_point) | -on(X,Y) | -line(Y) | -point(X).
% 192626 [binary:192560,192522.2,cut:192530,cut:192550,binarycut:192551] -on(X,at_least_one_line) | equal(Y,at_least_one_line) | equal(a_point,X) | -on(X,Y) | -line(Y) | -point(X).
% 193090 [para:192600.2.1,192577.1.1] line(line_from_to(point_1_on_line(at_least_one_line),X)) | on(X,at_least_one_line) | -point(X).
% 193098 [binary:192564,193090.3,cut:192590] line(line_from_to(point_1_on_line(at_least_one_line),point_not_on_line(at_least_one_line))).
% 193215 [para:192602.2.1,192579.1.1] line(line_from_to(point_2_on_line(at_least_one_line),X)) | on(X,at_least_one_line) | -point(X).
% 193223 [binary:192564,193215.3,cut:192590] line(line_from_to(point_2_on_line(at_least_one_line),point_not_on_line(at_least_one_line))).
% 193839 [para:192573.2.2,192590.1.1] on(X,line_from_to(X,point_not_on_line(at_least_one_line))) | -on(X,at_least_one_line) | -point(X).
% 193861 [binary:192558,193839.3,cut:192577] on(point_1_on_line(at_least_one_line),line_from_to(point_1_on_line(at_least_one_line),point_not_on_line(at_least_one_line))).
% 193862 [binary:192562,193839.3,cut:192579] on(point_2_on_line(at_least_one_line),line_from_to(point_2_on_line(at_least_one_line),point_not_on_line(at_least_one_line))).
% 193916 [para:192583.2.1,193861.1.1,factor:cut:192564] on(point_not_on_line(at_least_one_line),line_from_to(point_1_on_line(at_least_one_line),point_not_on_line(at_least_one_line))).
% 194758 [binary:193861,192624.4,cut:192577,cut:193098,cut:192558] equal(line_from_to(point_1_on_line(at_least_one_line),point_not_on_line(at_least_one_line)),at_least_one_line) | equal(point_1_on_line(at_least_one_line),a_point).
% 194818 [para:194758.1.1,193916.1.2,cut:192590] equal(point_1_on_line(at_least_one_line),a_point).
% 194821 [para:194818.1.1,192527.1.1,cut:192530] -equal(a_point,point_2_on_line(at_least_one_line)).
% 194973 [binary:193862,192626.4,cut:194821,cut:192579,cut:193223,cut:192562] equal(line_from_to(point_2_on_line(at_least_one_line),point_not_on_line(at_least_one_line)),at_least_one_line).
% 195129 [para:194973.1.1,192520.1.2,cut:192590,cut:192562,cut:192564] equal(point_2_on_line(at_least_one_line),point_not_on_line(at_least_one_line)).
% 195150 [para:195129.1.2,192528.1.1,cut:192579,cut:192530] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 31
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3254
% derived clauses: 413823
% kept clauses: 19001
% kept size sum: 616640
% kept mid-nuclei: 150660
% kept new demods: 8
% forw unit-subs: 87121
% forw double-subs: 1173
% forw overdouble-subs: 135590
% backward subs: 1095
% fast unit cutoff: 79082
% full unit cutoff: 0
% dbl unit cutoff: 22148
% real runtime : 27.65
% process. runtime: 27.63
% specific non-discr-tree subsumption statistics:
% tried: 2585702
% length fails: 36276
% strength fails: 543268
% predlist fails: 1539787
% aux str. fails: 13677
% by-lit fails: 106976
% full subs tried: 192087
% full subs fail: 183249
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/GEO/GEO076-4+eq_r.in")
%
%------------------------------------------------------------------------------