%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : GEO198+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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 : Mon Jun 24 06:04:26 EDT 2024
% Result : Theorem 0.99s 1.09s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : GEO198+1 : TPTP v8.2.0. Released v3.3.0.
% 0.08/0.09 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Fri Jun 21 10:45:23 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.14/0.47 start to proof:theBenchmark
% 0.99/1.08 %-------------------------------------------
% 0.99/1.08 % File :CSE---1.7
% 0.99/1.08 % Problem :theBenchmark
% 0.99/1.08 % Transform :cnf
% 0.99/1.08 % Format :tptp:raw
% 0.99/1.08 % Command :java -jar mcs_scs.jar %d %s
% 0.99/1.08
% 0.99/1.08 % Result :Theorem 0.580000s
% 0.99/1.08 % Output :CNFRefutation 0.580000s
% 0.99/1.08 %-------------------------------------------
% 0.99/1.09 %------------------------------------------------------------------------------
% 0.99/1.09 % File : GEO198+1 : TPTP v8.2.0. Released v3.3.0.
% 0.99/1.09 % Domain : Geometry (Constructive)
% 0.99/1.09 % Problem : Corollary to symmetry of incidence
% 0.99/1.09 % Version : [vPl95] axioms : Especial.
% 0.99/1.09 % English : If the lines X, Y, and Z are pairwise convergent, and the
% 0.99/1.09 % intersection point of X and Y is incident with Z, then the
% 0.99/1.09 % intersection point of X and Z is incident with Y.
% 0.99/1.09
% 0.99/1.09 % Refs : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 0.99/1.09 % : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 0.99/1.09 % Source : [ILTP]
% 0.99/1.09 % Names : Corollary 4.12.ii [vPl95]
% 0.99/1.09
% 0.99/1.09 % Status : Theorem
% 0.99/1.09 % Rating : 0.00 v6.1.0, 0.08 v6.0.0, 0.25 v5.5.0, 0.21 v5.4.0, 0.22 v5.3.0, 0.30 v5.2.0, 0.29 v5.0.0, 0.20 v4.1.0, 0.22 v4.0.1, 0.26 v4.0.0, 0.30 v3.7.0, 0.29 v3.5.0, 0.25 v3.4.0, 0.00 v3.3.0
% 0.99/1.09 % Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% 0.99/1.09 % Number of atoms : 40 ( 0 equ)
% 0.99/1.09 % Maximal formula atoms : 6 ( 2 avg)
% 0.99/1.09 % Number of connectives : 34 ( 9 ~; 9 |; 4 &)
% 0.99/1.09 % ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% 0.99/1.09 % Maximal formula depth : 9 ( 6 avg)
% 0.99/1.09 % Maximal term depth : 2 ( 1 avg)
% 0.99/1.09 % Number of predicates : 4 ( 4 usr; 0 prp; 2-2 aty)
% 0.99/1.09 % Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% 0.99/1.09 % Number of variables : 36 ( 36 !; 0 ?)
% 0.99/1.09 % SPC : FOF_THM_RFO_NEQ
% 0.99/1.09
% 0.99/1.09 % Comments : Definitions unfolded, hence Especial.
% 0.99/1.09 %------------------------------------------------------------------------------
% 0.99/1.09 include('Axioms/GEO006+0.ax').
% 0.99/1.09 %------------------------------------------------------------------------------
% 0.99/1.09 fof(con,conjecture,
% 0.99/1.09 ! [X,Y,Z] :
% 0.99/1.09 ( ( convergent_lines(X,Y)
% 0.99/1.09 & convergent_lines(Z,Y)
% 0.99/1.09 & convergent_lines(X,Z)
% 0.99/1.09 & ~ apart_point_and_line(intersection_point(X,Y),Z) )
% 0.99/1.09 => ~ apart_point_and_line(intersection_point(X,Z),Y) ) ).
% 0.99/1.09
% 0.99/1.09 %------------------------------------------------------------------------------
% 0.99/1.09 %-------------------------------------------
% 0.99/1.09 % Proof found
% 0.99/1.09 % SZS status Theorem for theBenchmark
% 0.99/1.09 % SZS output start Proof
% 0.99/1.09 %ClaNum:19(EqnAxiom:0)
% 0.99/1.09 %VarNum:74(SingletonVarNum:33)
% 0.99/1.09 %MaxLitNum:6
% 0.99/1.09 %MaxfuncDepth:1
% 0.99/1.09 %SharedTerms:10
% 0.99/1.09 %goalClause: 1 2 3 4 8
% 0.99/1.09 %singleGoalClaCount:5
% 0.99/1.09 [1]P1(a1,a2)
% 0.99/1.09 [2]P1(a1,a3)
% 0.99/1.09 [3]P1(a3,a2)
% 0.99/1.09 [4]P2(f4(a1,a3),a2)
% 0.99/1.09 [8]~P2(f4(a1,a2),a3)
% 0.99/1.09 [5]~P3(x51,x51)
% 0.99/1.09 [6]~P4(x61,x61)
% 0.99/1.09 [7]~P1(x71,x71)
% 0.99/1.09 [15]~P3(x151,x152)+~P2(x152,f5(x151,x152))
% 0.99/1.09 [16]~P3(x161,x162)+~P2(x161,f5(x161,x162))
% 0.99/1.09 [17]~P1(x171,x172)+~P2(f4(x171,x172),x172)
% 0.99/1.09 [18]~P1(x181,x182)+~P2(f4(x181,x182),x181)
% 0.99/1.09 [9]~P3(x93,x91)+P3(x91,x92)+P3(x93,x92)
% 0.99/1.09 [10]~P2(x101,x103)+P3(x101,x102)+P2(x102,x103)
% 0.99/1.09 [11]~P4(x113,x111)+P4(x111,x112)+P4(x113,x112)
% 0.99/1.09 [12]~P1(x123,x121)+P4(x121,x122)+P1(x123,x122)
% 0.99/1.09 [13]~P2(x133,x131)+P4(x131,x132)+P2(x133,x132)
% 0.99/1.09 [14]~P1(x143,x141)+P1(x141,x142)+P1(x143,x142)
% 0.99/1.09 [19]P2(x194,x193)+~P3(x194,x191)+~P4(x193,x192)+P2(x191,x192)+P2(x191,x193)+P2(x194,x192)
% 0.99/1.09 %EqnAxiom
% 0.99/1.09
% 0.99/1.09 %-------------------------------------------
% 0.99/1.09 cnf(29,plain,
% 0.99/1.09 (~P3(x291,x292)+~P2(x291,f5(x292,x291))),
% 0.99/1.09 inference(scs_inference,[],[5,15,9])).
% 0.99/1.09 cnf(30,plain,
% 0.99/1.09 (P4(a3,a1)),
% 0.99/1.09 inference(scs_inference,[],[2,7,12])).
% 0.99/1.09 cnf(37,plain,
% 0.99/1.09 (~P2(f4(a3,a2),a2)),
% 0.99/1.09 inference(scs_inference,[],[3,6,17,12])).
% 0.99/1.09 cnf(48,plain,
% 0.99/1.09 (P4(a1,a3)),
% 0.99/1.09 inference(scs_inference,[],[30,6,11])).
% 0.99/1.09 cnf(62,plain,
% 0.99/1.09 (~P2(f4(a1,a3),a3)),
% 0.99/1.09 inference(scs_inference,[],[2,6,17,12])).
% 0.99/1.09 cnf(69,plain,
% 0.99/1.09 (~P2(f4(a1,a3),a1)),
% 0.99/1.09 inference(scs_inference,[],[2,6,18,12])).
% 0.99/1.09 cnf(70,plain,
% 0.99/1.09 (~P2(f4(a3,a2),a3)),
% 0.99/1.09 inference(scs_inference,[],[3,6,18,13])).
% 0.99/1.09 cnf(71,plain,
% 0.99/1.09 (~P2(f4(a1,a2),a1)),
% 0.99/1.09 inference(scs_inference,[],[1,6,18,13])).
% 0.99/1.09 cnf(72,plain,
% 0.99/1.09 (~P2(f4(a3,a1),a3)),
% 0.99/1.09 inference(scs_inference,[],[7,2,18,14])).
% 0.99/1.09 cnf(84,plain,
% 0.99/1.09 (~P3(x841,x842)+~P2(x842,f5(x842,x841))),
% 0.99/1.09 inference(scs_inference,[],[5,9,16])).
% 0.99/1.09 cnf(97,plain,
% 0.99/1.09 (P3(f4(a1,a3),f4(a3,a2))),
% 0.99/1.09 inference(scs_inference,[],[4,3,10,17])).
% 0.99/1.09 cnf(100,plain,
% 0.99/1.09 (~P2(f4(a1,a3),f5(f4(a3,a2),f4(a1,a3)))),
% 0.99/1.09 inference(scs_inference,[],[4,37,10,29])).
% 0.99/1.09 cnf(103,plain,
% 0.99/1.09 (~P2(f4(a3,a2),f5(f4(a3,a2),f4(a1,a3)))),
% 0.99/1.09 inference(scs_inference,[],[5,97,10,84])).
% 0.99/1.09 cnf(107,plain,
% 0.99/1.09 (P3(f4(a1,a3),f4(a1,a2))),
% 0.99/1.09 inference(scs_inference,[],[4,1,10,17])).
% 0.99/1.09 cnf(109,plain,
% 0.99/1.09 (~P2(f4(a1,a3),f5(f4(a1,a3),f4(a1,a2)))),
% 0.99/1.09 inference(scs_inference,[],[5,107,10,16])).
% 0.99/1.09 cnf(123,plain,
% 0.99/1.09 (~P2(f4(a1,a2),f5(f4(a1,a3),f4(a1,a2)))),
% 0.99/1.09 inference(scs_inference,[],[107,6,15,13])).
% 0.99/1.09 cnf(145,plain,
% 0.99/1.09 (~P4(f5(f4(a3,a2),f4(a1,a3)),a3)),
% 0.99/1.09 inference(scs_inference,[],[97,5,62,70,103,100,9,19])).
% 0.99/1.09 cnf(148,plain,
% 0.99/1.09 (~P4(f5(f4(a1,a3),f4(a1,a2)),a3)),
% 0.99/1.09 inference(scs_inference,[],[8,109,107,62,123,145,13,19])).
% 0.99/1.09 cnf(153,plain,
% 0.99/1.09 ($false),
% 0.99/1.09 inference(scs_inference,[],[8,72,69,107,62,71,48,148,13,19]),
% 0.99/1.09 ['proof']).
% 0.99/1.09 % SZS output end Proof
% 0.99/1.09 % Total time :0.580000s
%------------------------------------------------------------------------------