%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : GEO225+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:44 EDT 2024
% Result : Theorem 2.02s 2.10s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO225+3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Jun 21 09:19:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 2.02/2.10 %-------------------------------------------
% 2.02/2.10 % File :CSE---1.7
% 2.02/2.10 % Problem :theBenchmark
% 2.02/2.10 % Transform :cnf
% 2.02/2.10 % Format :tptp:raw
% 2.02/2.10 % Command :java -jar mcs_scs.jar %d %s
% 2.02/2.10
% 2.02/2.10 % Result :Theorem 1.480000s
% 2.02/2.10 % Output :CNFRefutation 1.480000s
% 2.02/2.10 %-------------------------------------------
% 2.02/2.10 %------------------------------------------------------------------------------
% 2.02/2.10 % File : GEO225+3 : TPTP v8.2.0. Released v4.0.0.
% 2.02/2.10 % Domain : Geometry (Constructive)
% 2.02/2.10 % Problem : Existence of line joining distinct points
% 2.02/2.10 % Version : [vPl95] axioms.
% 2.02/2.10 % English : When there are two distinct points, then a line connecting
% 2.02/2.10 % them can be constructed.
% 2.02/2.10
% 2.02/2.10 % Refs : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 2.02/2.10 % : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 2.02/2.10 % : [Rat07] Raths (2007), Email to Geoff Sutcliffe
% 2.02/2.10 % Source : [Rat07]
% 2.02/2.10 % Names :
% 2.02/2.10
% 2.02/2.10 % Status : Theorem
% 2.02/2.10 % Rating : 0.00 v7.5.0, 0.05 v7.4.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.1.0, 0.08 v6.0.0, 0.25 v5.5.0, 0.12 v5.4.0, 0.13 v5.3.0, 0.22 v5.2.0, 0.14 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.11 v4.0.0
% 2.02/2.10 % Syntax : Number of formulae : 36 ( 7 unt; 0 def)
% 2.02/2.10 % Number of atoms : 99 ( 0 equ)
% 2.02/2.10 % Maximal formula atoms : 6 ( 2 avg)
% 2.02/2.10 % Number of connectives : 91 ( 28 ~; 19 |; 16 &)
% 2.02/2.10 % ( 5 <=>; 23 =>; 0 <=; 0 <~>)
% 2.02/2.10 % Maximal formula depth : 9 ( 5 avg)
% 2.02/2.10 % Maximal term depth : 2 ( 1 avg)
% 2.02/2.10 % Number of predicates : 12 ( 12 usr; 0 prp; 1-2 aty)
% 2.02/2.10 % Number of functors : 4 ( 4 usr; 0 con; 2-2 aty)
% 2.02/2.10 % Number of variables : 84 ( 83 !; 1 ?)
% 2.02/2.10 % SPC : FOF_THM_RFO_NEQ
% 2.02/2.10
% 2.02/2.10 % Comments :
% 2.02/2.10 %------------------------------------------------------------------------------
% 2.02/2.10 include('Axioms/GEO006+0.ax').
% 2.02/2.10 include('Axioms/GEO006+1.ax').
% 2.02/2.10 include('Axioms/GEO006+2.ax').
% 2.02/2.10 include('Axioms/GEO006+3.ax').
% 2.02/2.10 include('Axioms/GEO006+4.ax').
% 2.02/2.10 include('Axioms/GEO006+5.ax').
% 2.02/2.10 include('Axioms/GEO006+6.ax').
% 2.02/2.10 %------------------------------------------------------------------------------
% 2.02/2.10 fof(con,conjecture,
% 2.02/2.10 ! [A,B] :
% 2.02/2.10 ( ( point(A)
% 2.02/2.10 & point(B)
% 2.02/2.10 & distinct_points(A,B) )
% 2.02/2.10 => ? [X] :
% 2.02/2.10 ( line(X)
% 2.02/2.10 => ( incident_point_and_line(A,X)
% 2.02/2.10 & incident_point_and_line(B,X) ) ) ) ).
% 2.02/2.10
% 2.02/2.10 %------------------------------------------------------------------------------
% 2.02/2.10 %-------------------------------------------
% 2.02/2.10 % Proof found
% 2.02/2.10 % SZS status Theorem for theBenchmark
% 2.02/2.10 % SZS output start Proof
% 2.02/2.10 %ClaNum:47(EqnAxiom:0)
% 2.02/2.10 %VarNum:204(SingletonVarNum:93)
% 2.02/2.10 %MaxLitNum:6
% 2.02/2.10 %MaxfuncDepth:1
% 2.02/2.10 %SharedTerms:5
% 2.02/2.10 %goalClause: 1 2 3 19 32
% 2.02/2.10 %singleGoalClaCount:3
% 2.02/2.10 [1]P1(a1)
% 2.02/2.10 [2]P1(a2)
% 2.02/2.10 [3]P2(a1,a2)
% 2.02/2.10 [4]~P2(x41,x41)
% 2.02/2.10 [5]~P3(x51,x51)
% 2.02/2.10 [6]~P4(x61,x61)
% 2.02/2.10 [7]~P5(x71,f3(x72,x71))
% 2.02/2.10 [8]~P5(x81,f4(x82,x81))
% 2.02/2.11 [9]~P4(f3(x91,x92),x91)
% 2.02/2.11 [10]~P11(f4(x101,x102),x101)
% 2.02/2.11 [19]~P9(a2,x191)+~P9(a1,x191)
% 2.02/2.11 [11]P6(x111,x112)+P2(x111,x112)
% 2.02/2.11 [12]P7(x121,x122)+P3(x121,x122)
% 2.02/2.11 [14]P11(x141,x142)+P4(x141,x142)
% 2.02/2.11 [15]P8(x151,x152)+P4(x151,x152)
% 2.02/2.11 [16]P9(x161,x162)+P5(x161,x162)
% 2.02/2.11 [17]P10(x171,x172)+P11(x171,x172)
% 2.02/2.11 [18]~P3(x181,x182)+P4(x181,x182)
% 2.02/2.11 [20]~P6(x201,x202)+~P2(x201,x202)
% 2.02/2.11 [21]~P7(x211,x212)+~P3(x211,x212)
% 2.02/2.11 [22]~P8(x221,x222)+~P4(x221,x222)
% 2.02/2.11 [23]~P9(x231,x232)+~P5(x231,x232)
% 2.02/2.11 [24]~P10(x241,x242)+~P11(x241,x242)
% 2.02/2.11 [32]~P4(x321,x322)+P1(f5(x321,x322))
% 2.02/2.11 [43]~P2(x431,x432)+~P5(x432,f6(x431,x432))
% 2.02/2.11 [44]~P2(x441,x442)+~P5(x441,f6(x441,x442))
% 2.02/2.11 [45]~P4(x451,x452)+~P5(f5(x451,x452),x452)
% 2.02/2.11 [46]~P4(x461,x462)+~P5(f5(x461,x462),x461)
% 2.02/2.11 [25]~P2(x253,x251)+P2(x251,x252)+P2(x253,x252)
% 2.02/2.11 [26]~P5(x261,x263)+P2(x261,x262)+P5(x262,x263)
% 2.02/2.11 [27]~P3(x273,x271)+P3(x271,x272)+P3(x273,x272)
% 2.02/2.11 [28]~P4(x283,x281)+P3(x281,x282)+P4(x283,x282)
% 2.02/2.11 [29]~P5(x293,x291)+P3(x291,x292)+P5(x293,x292)
% 2.02/2.11 [30]~P4(x303,x301)+P4(x301,x302)+P4(x303,x302)
% 2.02/2.11 [31]~P4(x313,x312)+P11(x311,x312)+P11(x311,x313)
% 2.02/2.11 [35]~P4(x351,x353)+~P11(x351,x353)+P4(x351,x352)+P11(x353,x352)
% 2.02/2.11 [36]~P4(x362,x363)+~P11(x362,x363)+P4(x361,x362)+P4(x361,x363)
% 2.02/2.11 [37]~P4(x372,x373)+~P11(x372,x373)+P4(x371,x372)+P11(x371,x373)
% 2.02/2.11 [38]~P4(x383,x381)+~P11(x383,x381)+P4(x381,x382)+P11(x383,x382)
% 2.02/2.11 [39]~P4(x393,x392)+~P11(x393,x392)+P4(x391,x392)+P11(x391,x393)
% 2.02/2.11 [40]~P4(x401,x403)+~P11(x401,x403)+P11(x401,x402)+P11(x403,x402)
% 2.02/2.11 [42]P11(x423,x424)+~P3(x423,x422)+P5(x421,x422)+P5(x421,x423)+P11(x422,x424)
% 2.02/2.11 [47]P5(x474,x473)+~P2(x474,x471)+~P3(x473,x472)+P5(x471,x472)+P5(x471,x473)+P5(x474,x472)
% 2.02/2.11 %EqnAxiom
% 2.02/2.11
% 2.02/2.11 %-------------------------------------------
% 2.02/2.11 cnf(48,plain,
% 2.02/2.11 (~P6(a1,a2)),
% 2.02/2.11 inference(scs_inference,[],[3,20])).
% 2.02/2.11 cnf(112,plain,
% 2.02/2.11 (~P5(a2,f6(a1,a2))),
% 2.02/2.11 inference(scs_inference,[],[48,43,11])).
% 2.02/2.11 cnf(113,plain,
% 2.02/2.11 (P9(a2,f6(a1,a2))),
% 2.02/2.11 inference(scs_inference,[],[112,16])).
% 2.02/2.11 cnf(1118,plain,
% 2.02/2.11 (~P5(a1,f6(a1,a2))),
% 2.02/2.11 inference(scs_inference,[],[4,3,26,44])).
% 2.02/2.11 cnf(1121,plain,
% 2.02/2.11 ($false),
% 2.02/2.11 inference(scs_inference,[],[113,1118,16,19]),
% 2.02/2.11 ['proof']).
% 2.02/2.11 % SZS output end Proof
% 2.02/2.11 % Total time :1.480000s
%------------------------------------------------------------------------------