TSTP Solution File: GEO199+2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : GEO199+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n020.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 : Wed Aug 30 22:43:35 EDT 2023
% Result : Theorem 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GEO199+2 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 20:54:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % File :CSE---1.6
% 0.20/0.64 % Problem :theBenchmark
% 0.20/0.64 % Transform :cnf
% 0.20/0.64 % Format :tptp:raw
% 0.20/0.64 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.64
% 0.20/0.64 % Result :Theorem 0.020000s
% 0.20/0.64 % Output :CNFRefutation 0.020000s
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 % File : GEO199+2 : TPTP v8.1.2. Released v3.3.0.
% 0.20/0.64 % Domain : Geometry (Constructive)
% 0.20/0.64 % Problem : Corollary to symmetry of incidence
% 0.20/0.64 % Version : [vPl95] axioms : Reduced > Especial.
% 0.20/0.64 % English : If the lines X, Y, and Z are pairwise convergent, and the
% 0.20/0.64 % intersection point of X and Y is incident with Z, then the
% 0.20/0.64 % intersection point of Y and X is incident with Z.
% 0.20/0.64
% 0.20/0.64 % Refs : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 0.20/0.64 % : [Li97] Li (1997), Replacing the Axioms for Connecting Lines a
% 0.20/0.64 % : [Li98] Li (1998), A Shorter and Intuitive Axiom to Replace th
% 0.20/0.64 % : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 0.20/0.64 % Source : [ILTP]
% 0.20/0.64 % Names :
% 0.20/0.64
% 0.20/0.64 % Status : Theorem
% 0.20/0.64 % Rating : 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.21 v5.4.0, 0.22 v5.3.0, 0.26 v5.2.0, 0.21 v5.0.0, 0.15 v4.1.0, 0.17 v4.0.1, 0.16 v4.0.0, 0.20 v3.7.0, 0.29 v3.5.0, 0.25 v3.4.0, 0.00 v3.3.0
% 0.20/0.64 % Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% 0.20/0.64 % Number of atoms : 39 ( 0 equ)
% 0.20/0.64 % Maximal formula atoms : 6 ( 3 avg)
% 0.20/0.64 % Number of connectives : 31 ( 5 ~; 9 |; 5 &)
% 0.20/0.64 % ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% 0.20/0.64 % Maximal formula depth : 9 ( 6 avg)
% 0.20/0.64 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.64 % Number of predicates : 4 ( 4 usr; 0 prp; 2-2 aty)
% 0.20/0.64 % Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% 0.20/0.64 % Number of variables : 33 ( 33 !; 0 ?)
% 0.20/0.64 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.64
% 0.20/0.64 % Comments : Definitions unfolded, hence Especial.
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 include('Axioms/GEO008+0.ax').
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 fof(con,conjecture,
% 0.20/0.64 ! [X,Y,Z] :
% 0.20/0.64 ( ( convergent_lines(X,Y)
% 0.20/0.64 & convergent_lines(Z,Y)
% 0.20/0.64 & convergent_lines(X,Z)
% 0.20/0.64 & ~ apart_point_and_line(intersection_point(X,Y),Z) )
% 0.20/0.64 => ~ apart_point_and_line(intersection_point(Y,X),Z) ) ).
% 0.20/0.64
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:19(EqnAxiom:0)
% 0.20/0.64 %VarNum:80(SingletonVarNum:36)
% 0.20/0.64 %MaxLitNum:6
% 0.20/0.64 %MaxfuncDepth:1
% 0.20/0.64 %SharedTerms:10
% 0.20/0.64 %goalClause: 1 2 3 4 8
% 0.20/0.65 %singleGoalClaCount:5
% 0.20/0.65 [1]P1(a1,a2)
% 0.20/0.65 [2]P1(a1,a3)
% 0.20/0.65 [3]P1(a3,a2)
% 0.20/0.65 [4]P2(f4(a2,a1),a3)
% 0.20/0.65 [8]~P2(f4(a1,a2),a3)
% 0.20/0.65 [5]~P3(x51,x51)
% 0.20/0.65 [6]~P4(x61,x61)
% 0.20/0.65 [7]~P1(x71,x71)
% 0.20/0.65 [9]~P1(x91,x92)+P4(x91,x92)
% 0.20/0.65 [10]~P3(x103,x101)+P3(x101,x102)+P3(x103,x102)
% 0.20/0.65 [11]~P2(x111,x113)+P3(x111,x112)+P2(x112,x113)
% 0.20/0.65 [12]~P4(x123,x121)+P4(x121,x122)+P4(x123,x122)
% 0.20/0.65 [13]~P2(x133,x131)+P4(x131,x132)+P2(x133,x132)
% 0.20/0.65 [14]~P1(x143,x141)+P1(x141,x142)+P1(x143,x142)
% 0.20/0.65 [15]~P1(x152,x153)+~P2(x151,x153)+P3(x151,f4(x152,x153))
% 0.20/0.65 [16]~P1(x162,x163)+~P2(x161,x162)+P3(x161,f4(x162,x163))
% 0.20/0.65 [17]P3(x171,x172)+~P3(x173,x172)+~P2(x171,f5(x173,x172))
% 0.20/0.65 [18]P3(x181,x182)+~P3(x182,x183)+~P2(x181,f5(x182,x183))
% 0.20/0.65 [19]P2(x194,x193)+~P3(x194,x191)+~P4(x193,x192)+P2(x191,x192)+P2(x191,x193)+P2(x194,x192)
% 0.20/0.65 %EqnAxiom
% 0.20/0.65
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 cnf(20,plain,
% 0.20/0.65 (P1(a2,a1)),
% 0.20/0.65 inference(scs_inference,[],[1,7,14])).
% 0.20/0.65 cnf(22,plain,
% 0.20/0.65 (P3(f4(a2,a1),f4(a1,a2))),
% 0.20/0.65 inference(scs_inference,[],[1,7,4,8,14,11])).
% 0.20/0.65 cnf(24,plain,
% 0.20/0.65 (P3(f4(a1,a2),f4(a2,a1))),
% 0.20/0.65 inference(scs_inference,[],[1,5,7,4,8,14,11,10])).
% 0.20/0.65 cnf(25,plain,
% 0.20/0.65 (~P3(x251,x251)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(27,plain,
% 0.20/0.65 (~P2(f4(a1,a2),a1)),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,7,4,8,14,11,10,16])).
% 0.20/0.65 cnf(28,plain,
% 0.20/0.65 (~P3(x281,x281)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(30,plain,
% 0.20/0.65 (~P2(f4(a1,a2),a2)),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,28,7,4,8,14,11,10,16,15])).
% 0.20/0.65 cnf(31,plain,
% 0.20/0.65 (~P3(x311,x311)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(33,plain,
% 0.20/0.65 (P4(a1,a2)),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,28,7,4,8,14,11,10,16,15,9])).
% 0.20/0.65 cnf(35,plain,
% 0.20/0.65 (~P2(f4(a2,a1),f5(f4(a2,a1),f4(a1,a2)))),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,28,31,7,4,8,14,11,10,16,15,9,18])).
% 0.20/0.65 cnf(47,plain,
% 0.20/0.65 (~P3(x471,x471)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(52,plain,
% 0.20/0.65 (~P3(x521,x521)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(56,plain,
% 0.20/0.65 (P2(f4(a2,a1),a2)+P2(f4(a2,a1),a1)),
% 0.20/0.65 inference(scs_inference,[],[6,2,5,47,52,4,35,22,24,33,30,27,12,13,18,15,17,16,19])).
% 0.20/0.65 cnf(68,plain,
% 0.20/0.65 (~P2(f4(a3,a2),a2)),
% 0.20/0.65 inference(scs_inference,[],[3,5,15])).
% 0.20/0.65 cnf(69,plain,
% 0.20/0.65 (~P3(x691,x691)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(71,plain,
% 0.20/0.65 (P4(a3,a2)),
% 0.20/0.65 inference(scs_inference,[],[3,5,15,9])).
% 0.20/0.65 cnf(73,plain,
% 0.20/0.65 (~P2(f4(a3,a2),a3)),
% 0.20/0.65 inference(scs_inference,[],[3,5,69,15,9,16])).
% 0.20/0.65 cnf(79,plain,
% 0.20/0.65 (~P3(x791,x791)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(86,plain,
% 0.20/0.65 ($false),
% 0.20/0.65 inference(scs_inference,[],[20,8,22,5,79,73,71,68,24,30,19,15,18,17,56,16]),
% 0.20/0.65 ['proof']).
% 0.20/0.65 % SZS output end Proof
% 0.20/0.65 % Total time :0.020000s
%------------------------------------------------------------------------------