TSTP Solution File: GEO191+2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : GEO191+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n007.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:30 EDT 2023
% Result : Theorem 0.50s 0.62s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO191+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n007.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 : Tue Aug 29 20:42:58 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.50/0.55 start to proof:theBenchmark
% 0.50/0.61 %-------------------------------------------
% 0.50/0.61 % File :CSE---1.6
% 0.50/0.61 % Problem :theBenchmark
% 0.50/0.61 % Transform :cnf
% 0.50/0.61 % Format :tptp:raw
% 0.50/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.50/0.61
% 0.50/0.61 % Result :Theorem 0.010000s
% 0.50/0.61 % Output :CNFRefutation 0.010000s
% 0.50/0.61 %-------------------------------------------
% 0.50/0.62 %------------------------------------------------------------------------------
% 0.50/0.62 % File : GEO191+2 : TPTP v8.1.2. Released v3.3.0.
% 0.50/0.62 % Domain : Geometry (Constructive)
% 0.50/0.62 % Problem : Symmetry of apartness
% 0.50/0.62 % Version : [vPl95] axioms : Reduced > Especial.
% 0.50/0.62 % English : If the lines X and Y are convergent, U and V are convergent,
% 0.50/0.62 % and the intersection point of X and Y is apart from U and V,
% 0.50/0.62 % then the intersection point of U and V is apart from X and Y.
% 0.50/0.62
% 0.50/0.62 % Refs : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 0.50/0.62 % : [Li97] Li (1997), Replacing the Axioms for Connecting Lines a
% 0.50/0.62 % : [Li98] Li (1998), A Shorter and Intuitive Axiom to Replace th
% 0.50/0.62 % : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 0.50/0.62 % Source : [ILTP]
% 0.50/0.62 % Names :
% 0.50/0.62
% 0.50/0.62 % Status : Theorem
% 0.50/0.62 % Rating : 0.00 v6.1.0, 0.08 v6.0.0, 0.00 v5.5.0, 0.21 v5.4.0, 0.17 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.00 v3.3.0
% 0.50/0.62 % Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% 0.50/0.62 % Number of atoms : 40 ( 0 equ)
% 0.50/0.62 % Maximal formula atoms : 6 ( 3 avg)
% 0.50/0.62 % Number of connectives : 30 ( 3 ~; 11 |; 4 &)
% 0.50/0.62 % ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% 0.50/0.62 % Maximal formula depth : 9 ( 6 avg)
% 0.50/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.50/0.62 % Number of predicates : 4 ( 4 usr; 0 prp; 2-2 aty)
% 0.50/0.62 % Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% 0.50/0.62 % Number of variables : 34 ( 34 !; 0 ?)
% 0.50/0.62 % SPC : FOF_THM_RFO_NEQ
% 0.50/0.62
% 0.50/0.62 % Comments : Definitions unfolded, hence Especial.
% 0.50/0.62 %------------------------------------------------------------------------------
% 0.50/0.62 include('Axioms/GEO008+0.ax').
% 0.50/0.62 %------------------------------------------------------------------------------
% 0.50/0.62 fof(con,conjecture,
% 0.50/0.62 ! [X,Y,U,V] :
% 0.50/0.62 ( ( convergent_lines(X,Y)
% 0.50/0.62 & convergent_lines(U,V)
% 0.50/0.62 & ( apart_point_and_line(intersection_point(X,Y),U)
% 0.50/0.62 | apart_point_and_line(intersection_point(X,Y),V) ) )
% 0.50/0.62 => ( apart_point_and_line(intersection_point(U,V),X)
% 0.50/0.62 | apart_point_and_line(intersection_point(U,V),Y) ) ) ).
% 0.50/0.62
% 0.50/0.62 %------------------------------------------------------------------------------
% 0.50/0.62 %-------------------------------------------
% 0.50/0.62 % Proof found
% 0.50/0.62 % SZS status Theorem for theBenchmark
% 0.50/0.62 % SZS output start Proof
% 0.50/0.62 %ClaNum:19(EqnAxiom:0)
% 0.50/0.62 %VarNum:80(SingletonVarNum:36)
% 0.50/0.62 %MaxLitNum:6
% 0.50/0.62 %MaxfuncDepth:1
% 0.50/0.62 %SharedTerms:12
% 0.50/0.62 %goalClause: 1 2 6 7 14
% 0.50/0.62 %singleGoalClaCount:4
% 0.50/0.62 [1]P1(a1,a2)
% 0.50/0.62 [2]P1(a3,a4)
% 0.50/0.62 [6]~P2(f5(a3,a4),a1)
% 0.50/0.62 [7]~P2(f5(a3,a4),a2)
% 0.50/0.62 [3]~P3(x31,x31)
% 0.50/0.62 [4]~P4(x41,x41)
% 0.50/0.62 [5]~P1(x51,x51)
% 0.50/0.62 [14]P2(f5(a1,a2),a4)+P2(f5(a1,a2),a3)
% 0.50/0.62 [8]~P1(x81,x82)+P4(x81,x82)
% 0.50/0.62 [9]~P3(x93,x91)+P3(x91,x92)+P3(x93,x92)
% 0.50/0.62 [10]~P2(x101,x103)+P3(x101,x102)+P2(x102,x103)
% 0.50/0.62 [11]~P4(x113,x111)+P4(x111,x112)+P4(x113,x112)
% 0.50/0.62 [12]~P2(x123,x121)+P4(x121,x122)+P2(x123,x122)
% 0.50/0.62 [13]~P1(x133,x131)+P1(x131,x132)+P1(x133,x132)
% 0.50/0.62 [15]~P1(x152,x153)+~P2(x151,x153)+P3(x151,f5(x152,x153))
% 0.50/0.62 [16]~P1(x162,x163)+~P2(x161,x162)+P3(x161,f5(x162,x163))
% 0.50/0.62 [17]P3(x171,x172)+~P3(x173,x172)+~P2(x171,f6(x173,x172))
% 0.50/0.62 [18]P3(x181,x182)+~P3(x182,x183)+~P2(x181,f6(x182,x183))
% 0.50/0.62 [19]P2(x194,x193)+~P3(x194,x191)+~P4(x193,x192)+P2(x191,x192)+P2(x191,x193)+P2(x194,x192)
% 0.50/0.62 %EqnAxiom
% 0.50/0.62
% 0.50/0.62 %-------------------------------------------
% 0.50/0.62 cnf(22,plain,
% 0.50/0.62 (~P2(f5(a1,a2),a1)),
% 0.50/0.62 inference(scs_inference,[],[1,3,5,13,16])).
% 0.50/0.62 cnf(23,plain,
% 0.50/0.62 (~P3(x231,x231)),
% 0.50/0.62 inference(rename_variables,[],[3])).
% 0.50/0.62 cnf(25,plain,
% 0.50/0.62 (~P2(f5(a1,a2),a2)),
% 0.50/0.62 inference(scs_inference,[],[1,3,23,5,13,16,15])).
% 0.50/0.62 cnf(28,plain,
% 0.50/0.62 (P4(a1,a2)),
% 0.50/0.62 inference(scs_inference,[],[1,3,23,5,13,16,15,8])).
% 0.50/0.62 cnf(47,plain,
% 0.50/0.62 (~P3(f5(a1,a2),f5(a3,a4))),
% 0.50/0.62 inference(scs_inference,[],[6,7,22,25,28,19])).
% 0.50/0.62 cnf(65,plain,
% 0.50/0.62 (P2(f5(a1,a2),a4)),
% 0.50/0.62 inference(scs_inference,[],[2,47,14,16])).
% 0.50/0.62 cnf(68,plain,
% 0.50/0.62 ($false),
% 0.50/0.62 inference(scs_inference,[],[22,65,47,2,12,15]),
% 0.50/0.62 ['proof']).
% 0.50/0.62 % SZS output end Proof
% 0.50/0.62 % Total time :0.010000s
%------------------------------------------------------------------------------