TSTP Solution File: GEO203+2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : GEO203+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 : n013.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:38 EDT 2023
% Result : Theorem 0.20s 0.65s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO203+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 : n013.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 18:49:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 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.000000s
% 0.20/0.64 % Output :CNFRefutation 0.000000s
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 % File : GEO203+2 : TPTP v8.1.2. Released v3.3.0.
% 0.20/0.64 % Domain : Geometry (Constructive)
% 0.20/0.64 % Problem : Equal lines from points
% 0.20/0.64 % Version : [vPl95] axioms : Reduced > Especial.
% 0.20/0.64 % English : If the lines X and Y are convergent, and X and Z are convergent,
% 0.20/0.64 % the intersection point of X and Y, and the intersection point
% 0.20/0.64 % of X and Z are distinct, then the line connecting these points
% 0.20/0.64 % is equal to X.
% 0.20/0.64
% 0.20/0.65 % Refs : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 0.20/0.65 % : [Li97] Li (1997), Replacing the Axioms for Connecting Lines a
% 0.20/0.65 % : [Li98] Li (1998), A Shorter and Intuitive Axiom to Replace th
% 0.20/0.65 % : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 0.20/0.65 % Source : [ILTP]
% 0.20/0.65 % Names :
% 0.20/0.65
% 0.20/0.65 % Status : Theorem
% 0.20/0.65 % 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.35 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.20/0.65 % Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% 0.20/0.65 % Number of atoms : 38 ( 0 equ)
% 0.20/0.65 % Maximal formula atoms : 6 ( 2 avg)
% 0.20/0.65 % Number of connectives : 29 ( 4 ~; 9 |; 4 &)
% 0.20/0.65 % ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% 0.20/0.65 % Maximal formula depth : 9 ( 6 avg)
% 0.20/0.65 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.65 % Number of predicates : 4 ( 4 usr; 0 prp; 2-2 aty)
% 0.20/0.65 % Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% 0.20/0.65 % Number of variables : 33 ( 33 !; 0 ?)
% 0.20/0.65 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.65
% 0.20/0.65 % Comments : Definitions unfolded, hence Especial.
% 0.20/0.65 %------------------------------------------------------------------------------
% 0.20/0.65 include('Axioms/GEO008+0.ax').
% 0.20/0.65 %------------------------------------------------------------------------------
% 0.20/0.65 fof(con,conjecture,
% 0.20/0.65 ! [X,Y,Z] :
% 0.20/0.65 ( ( convergent_lines(X,Y)
% 0.20/0.65 & convergent_lines(X,Z)
% 0.20/0.65 & distinct_points(intersection_point(X,Y),intersection_point(X,Z)) )
% 0.20/0.65 => ~ distinct_lines(line_connecting(intersection_point(X,Y),intersection_point(X,Z)),X) ) ).
% 0.20/0.65
% 0.20/0.65 %------------------------------------------------------------------------------
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 % Proof found
% 0.20/0.65 % SZS status Theorem for theBenchmark
% 0.20/0.65 % SZS output start Proof
% 0.20/0.65 %ClaNum:18(EqnAxiom:0)
% 0.20/0.65 %VarNum:80(SingletonVarNum:36)
% 0.20/0.65 %MaxLitNum:6
% 0.20/0.65 %MaxfuncDepth:2
% 0.20/0.65 %SharedTerms:10
% 0.20/0.65 %goalClause: 1 2 3 4
% 0.20/0.65 %singleGoalClaCount:4
% 0.20/0.65 [1]P1(a1,a2)
% 0.20/0.65 [2]P1(a1,a3)
% 0.20/0.65 [3]P3(f4(a1,a2),f4(a1,a3))
% 0.20/0.65 [4]P4(f5(f4(a1,a2),f4(a1,a3)),a1)
% 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 [8]~P1(x81,x82)+P4(x81,x82)
% 0.20/0.65 [9]~P3(x93,x91)+P3(x91,x92)+P3(x93,x92)
% 0.20/0.65 [10]~P2(x101,x103)+P3(x101,x102)+P2(x102,x103)
% 0.20/0.65 [11]~P4(x113,x111)+P4(x111,x112)+P4(x113,x112)
% 0.20/0.65 [12]~P2(x123,x121)+P4(x121,x122)+P2(x123,x122)
% 0.20/0.65 [13]~P1(x133,x131)+P1(x131,x132)+P1(x133,x132)
% 0.20/0.65 [14]~P1(x142,x143)+~P2(x141,x143)+P3(x141,f4(x142,x143))
% 0.20/0.65 [15]~P1(x152,x153)+~P2(x151,x152)+P3(x151,f4(x152,x153))
% 0.20/0.65 [16]P3(x161,x162)+~P3(x163,x162)+~P2(x161,f5(x163,x162))
% 0.20/0.65 [17]P3(x171,x172)+~P3(x172,x173)+~P2(x171,f5(x172,x173))
% 0.20/0.65 [18]P2(x184,x183)+~P3(x184,x181)+~P4(x183,x182)+P2(x181,x182)+P2(x181,x183)+P2(x184,x182)
% 0.20/0.65 %EqnAxiom
% 0.20/0.65
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 cnf(24,plain,
% 0.20/0.65 (P3(f4(a1,a3),f4(a1,a2))),
% 0.20/0.65 inference(scs_inference,[],[1,5,6,7,3,4,13,11,9])).
% 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,6,7,3,4,13,11,9,15])).
% 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(31,plain,
% 0.20/0.65 (~P3(x311,x311)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(35,plain,
% 0.20/0.65 (~P2(f4(a1,a2),f5(f4(a1,a2),f4(a1,a3)))),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,28,31,6,7,3,4,13,11,9,15,14,8,17])).
% 0.20/0.65 cnf(36,plain,
% 0.20/0.65 (~P3(x361,x361)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(38,plain,
% 0.20/0.65 (~P2(f4(a1,a3),f5(f4(a1,a2),f4(a1,a3)))),
% 0.20/0.65 inference(scs_inference,[],[1,5,25,28,31,36,6,7,3,4,13,11,9,15,14,8,17,16])).
% 0.20/0.65 cnf(43,plain,
% 0.20/0.65 (~P3(x431,x431)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(46,plain,
% 0.20/0.65 (~P3(x461,x461)),
% 0.20/0.65 inference(rename_variables,[],[5])).
% 0.20/0.65 cnf(48,plain,
% 0.20/0.65 ($false),
% 0.20/0.65 inference(scs_inference,[],[2,5,43,46,4,38,35,24,27,18,17,16,15]),
% 0.20/0.65 ['proof']).
% 0.20/0.65 % SZS output end Proof
% 0.20/0.65 % Total time :0.000000s
%------------------------------------------------------------------------------