TSTP Solution File: GEO242+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : GEO242+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n010.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  : 300s
% DateTime : Fri Sep 16 20:36:00 EDT 2022

% Result   : Theorem 0.12s 0.36s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO242+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.11/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33  % Computer : n010.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  : 300
% 0.12/0.33  % DateTime : Wed Aug 31 07:01:58 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.33  Usage: tptp [options] [-file:]file
% 0.12/0.33    -h, -?       prints this message.
% 0.12/0.33    -smt2        print SMT-LIB2 benchmark.
% 0.12/0.33    -m, -model   generate model.
% 0.12/0.33    -p, -proof   generate proof.
% 0.12/0.33    -c, -core    generate unsat core of named formulas.
% 0.12/0.33    -st, -statistics display statistics.
% 0.12/0.33    -t:timeout   set timeout (in second).
% 0.12/0.33    -smt2status  display status in smt2 format instead of SZS.
% 0.12/0.33    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.33    -<param>:<value> configuration parameter and value.
% 0.12/0.33    -o:<output-file> file to place output in.
% 0.12/0.36  % SZS status Theorem
% 0.12/0.36  % SZS output start Proof
% 0.12/0.36  tff(left_convergent_lines_type, type, (
% 0.12/0.36     left_convergent_lines: ( $i * $i ) > $o)).
% 0.12/0.36  tff(reverse_line_type, type, (
% 0.12/0.36     reverse_line: $i > $i)).
% 0.12/0.36  tff(line_connecting_type, type, (
% 0.12/0.36     line_connecting: ( $i * $i ) > $i)).
% 0.12/0.36  tff(tptp_fun_B_1_type, type, (
% 0.12/0.36     tptp_fun_B_1: $i)).
% 0.12/0.36  tff(tptp_fun_A_2_type, type, (
% 0.12/0.36     tptp_fun_A_2: $i)).
% 0.12/0.36  tff(tptp_fun_L_0_type, type, (
% 0.12/0.36     tptp_fun_L_0: $i)).
% 0.12/0.36  tff(distinct_points_type, type, (
% 0.12/0.36     distinct_points: ( $i * $i ) > $o)).
% 0.12/0.36  tff(apart_point_and_line_type, type, (
% 0.12/0.36     apart_point_and_line: ( $i * $i ) > $o)).
% 0.12/0.36  tff(left_apart_point_type, type, (
% 0.12/0.36     left_apart_point: ( $i * $i ) > $o)).
% 0.12/0.36  tff(1,plain,
% 0.12/0.36      ((~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))) <=> (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L))))),
% 0.12/0.36      inference(rewrite,[status(thm)],[])).
% 0.12/0.36  tff(2,plain,
% 0.12/0.36      ((~![A: $i, B: $i, L: $i] : ((((~apart_point_and_line(A, L)) & distinct_points(A, B)) & left_convergent_lines(L, reverse_line(line_connecting(A, B)))) => left_apart_point(B, reverse_line(L)))) <=> (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L))))),
% 0.12/0.36      inference(rewrite,[status(thm)],[])).
% 0.12/0.36  tff(3,axiom,(~![A: $i, B: $i, L: $i] : ((((~apart_point_and_line(A, L)) & distinct_points(A, B)) & left_convergent_lines(L, reverse_line(line_connecting(A, B)))) => left_apart_point(B, reverse_line(L)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','con')).
% 0.12/0.36  tff(4,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[3, 2])).
% 0.12/0.36  tff(5,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[4, 1])).
% 0.12/0.36  tff(6,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[5, 1])).
% 0.12/0.36  tff(7,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[6, 1])).
% 0.12/0.36  tff(8,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[7, 1])).
% 0.12/0.36  tff(9,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[8, 1])).
% 0.12/0.36  tff(10,plain,
% 0.12/0.36      (~![A: $i, B: $i, L: $i] : ((~((~apart_point_and_line(A, L)) & distinct_points(A, B) & left_convergent_lines(L, reverse_line(line_connecting(A, B))))) | left_apart_point(B, reverse_line(L)))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[9, 1])).
% 0.12/0.36  tff(11,plain,(
% 0.12/0.36      ~((~((~apart_point_and_line(A!2, L!0)) & distinct_points(A!2, B!1) & left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1))))) | left_apart_point(B!1, reverse_line(L!0)))),
% 0.12/0.36      inference(skolemize,[status(sab)],[10])).
% 0.12/0.36  tff(12,plain,
% 0.12/0.36      ((~apart_point_and_line(A!2, L!0)) & distinct_points(A!2, B!1) & left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1)))),
% 0.12/0.36      inference(or_elim,[status(thm)],[11])).
% 0.12/0.36  tff(13,plain,
% 0.12/0.36      (left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1)))),
% 0.12/0.36      inference(and_elim,[status(thm)],[12])).
% 0.12/0.36  tff(14,plain,
% 0.12/0.36      ((left_convergent_lines(L!0, line_connecting(A!2, B!1)) | left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1)))) | (~left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1))))),
% 0.12/0.36      inference(tautology,[status(thm)],[])).
% 0.12/0.36  tff(15,plain,
% 0.12/0.36      (left_convergent_lines(L!0, line_connecting(A!2, B!1)) | left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1)))),
% 0.12/0.36      inference(unit_resolution,[status(thm)],[14, 13])).
% 0.12/0.36  tff(16,plain,
% 0.12/0.36      (^[L: $i, M: $i] : refl((~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M)))) <=> (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M)))))),
% 0.12/0.36      inference(bind,[status(th)],[])).
% 0.12/0.36  tff(17,plain,
% 0.12/0.36      (![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M)))) <=> ![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))),
% 0.12/0.36      inference(quant_intro,[status(thm)],[16])).
% 0.12/0.36  tff(18,plain,
% 0.12/0.36      (![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M)))) <=> ![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))),
% 0.12/0.36      inference(rewrite,[status(thm)],[])).
% 0.12/0.36  tff(19,axiom,(![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))), file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax','oag11')).
% 0.12/0.36  tff(20,plain,
% 0.12/0.36      (![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[19, 18])).
% 0.12/0.36  tff(21,plain,(
% 0.12/0.36      ![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))),
% 0.12/0.36      inference(skolemize,[status(sab)],[20])).
% 0.12/0.36  tff(22,plain,
% 0.12/0.36      (![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))),
% 0.12/0.36      inference(modus_ponens,[status(thm)],[21, 17])).
% 0.12/0.36  tff(23,plain,
% 0.12/0.36      ((~![L: $i, M: $i] : (~(left_convergent_lines(L, M) | left_convergent_lines(L, reverse_line(M))))) | (~(left_convergent_lines(L!0, line_connecting(A!2, B!1)) | left_convergent_lines(L!0, reverse_line(line_connecting(A!2, B!1)))))),
% 0.12/0.36      inference(quant_inst,[status(thm)],[])).
% 0.12/0.36  tff(24,plain,
% 0.12/0.36      ($false),
% 0.12/0.36      inference(unit_resolution,[status(thm)],[23, 22, 15])).
% 0.12/0.36  % SZS output end Proof
%------------------------------------------------------------------------------