↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : GEO172+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 : n027.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:08 EDT 2024

% Result   : Theorem 1.03s 1.11s
% Output   : CNFRefutation 1.03s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GEO172+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n027.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   : Fri Jun 21 07:46:24 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.55/0.58  start to proof:theBenchmark
% 1.03/1.11  %-------------------------------------------
% 1.03/1.11  % File        :CSE---1.7
% 1.03/1.11  % Problem     :theBenchmark
% 1.03/1.11  % Transform   :cnf
% 1.03/1.11  % Format      :tptp:raw
% 1.03/1.11  % Command     :java -jar mcs_scs.jar %d %s
% 1.03/1.11  
% 1.03/1.11  % Result      :Theorem 0.490000s
% 1.03/1.11  % Output      :CNFRefutation 0.490000s
% 1.03/1.11  %-------------------------------------------
% 1.03/1.11  %------------------------------------------------------------------------------
% 1.03/1.11  % File     : GEO172+1 : TPTP v8.2.0. Released v3.3.0.
% 1.03/1.11  % Domain   : Geometry (Constructive)
% 1.03/1.11  % Problem  : Uniqueness of constructed points
% 1.03/1.11  % Version  : [vPl95] axioms : Especial.
% 1.03/1.11  % English  : If two lines are convergent and there is a point that is
% 1.03/1.11  %            incident with both lines, then this point is equivalent to the
% 1.03/1.11  %            intersection point of these lines.
% 1.03/1.11  
% 1.03/1.11  % Refs     : [vPl95] von Plato (1995), The Axioms of Constructive Geometry
% 1.03/1.11  %          : [ROK06] Raths et al. (2006), The ILTP Problem Library for Intu
% 1.03/1.11  % Source   : [ILTP]
% 1.03/1.11  % Names    : Theorem 3.3 [vPl95]
% 1.03/1.11  
% 1.03/1.11  % Status   : Theorem
% 1.03/1.11  % Rating   : 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.12 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.14 v5.0.0, 0.00 v4.0.0, 0.05 v3.7.0, 0.00 v3.3.0
% 1.03/1.11  % Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
% 1.03/1.11  %            Number of atoms       :   39 (   0 equ)
% 1.03/1.11  %            Maximal formula atoms :    6 (   2 avg)
% 1.03/1.11  %            Number of connectives :   34 (  10   ~;   9   |;   3   &)
% 1.03/1.11  %                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
% 1.03/1.11  %            Maximal formula depth :    9 (   5 avg)
% 1.03/1.11  %            Maximal term depth    :    2 (   1 avg)
% 1.03/1.11  %            Number of predicates  :    4 (   4 usr;   0 prp; 2-2 aty)
% 1.03/1.11  %            Number of functors    :    2 (   2 usr;   0 con; 2-2 aty)
% 1.03/1.11  %            Number of variables   :   36 (  36   !;   0   ?)
% 1.03/1.11  % SPC      : FOF_THM_RFO_NEQ
% 1.03/1.11  
% 1.03/1.11  % Comments : Definitions unfolded, hence Especial.
% 1.03/1.11  %------------------------------------------------------------------------------
% 1.03/1.11  include('Axioms/GEO006+0.ax').
% 1.03/1.11  %------------------------------------------------------------------------------
% 1.03/1.11  fof(con,conjecture,
% 1.03/1.11      ! [X,Y,Z] :
% 1.03/1.11        ( ( convergent_lines(X,Y)
% 1.03/1.11          & ~ apart_point_and_line(Z,X)
% 1.03/1.11          & ~ apart_point_and_line(Z,Y) )
% 1.03/1.11       => ~ distinct_points(Z,intersection_point(X,Y)) ) ).
% 1.03/1.11  
% 1.03/1.11  %------------------------------------------------------------------------------
% 1.03/1.11  %-------------------------------------------
% 1.03/1.11  % Proof found
% 1.03/1.11  % SZS status Theorem for theBenchmark
% 1.03/1.11  % SZS output start Proof
% 1.03/1.11  %ClaNum:18(EqnAxiom:0)
% 1.03/1.11  %VarNum:74(SingletonVarNum:33)
% 1.03/1.11  %MaxLitNum:6
% 1.03/1.11  %MaxfuncDepth:1
% 1.03/1.11  %SharedTerms:8
% 1.03/1.11  %goalClause: 1 2 3 4
% 1.03/1.11  %singleGoalClaCount:4
% 1.03/1.11  [1]P1(a1,a2)
% 1.03/1.11  [3]~P2(a3,a1)
% 1.03/1.11  [4]~P2(a3,a2)
% 1.03/1.11  [2]P3(a3,f4(a1,a2))
% 1.03/1.11  [5]~P3(x51,x51)
% 1.03/1.11  [6]~P4(x61,x61)
% 1.03/1.11  [7]~P1(x71,x71)
% 1.03/1.11  [14]~P3(x141,x142)+~P2(x142,f5(x141,x142))
% 1.03/1.11  [15]~P3(x151,x152)+~P2(x151,f5(x151,x152))
% 1.03/1.11  [16]~P1(x161,x162)+~P2(f4(x161,x162),x162)
% 1.03/1.11  [17]~P1(x171,x172)+~P2(f4(x171,x172),x171)
% 1.03/1.11  [8]~P3(x83,x81)+P3(x81,x82)+P3(x83,x82)
% 1.03/1.11  [9]~P2(x91,x93)+P3(x91,x92)+P2(x92,x93)
% 1.03/1.12  [10]~P4(x103,x101)+P4(x101,x102)+P4(x103,x102)
% 1.03/1.12  [11]~P1(x113,x111)+P4(x111,x112)+P1(x113,x112)
% 1.03/1.12  [12]~P2(x123,x121)+P4(x121,x122)+P2(x123,x122)
% 1.03/1.12  [13]~P1(x133,x131)+P1(x131,x132)+P1(x133,x132)
% 1.03/1.12  [18]P2(x184,x183)+~P3(x184,x181)+~P4(x183,x182)+P2(x181,x182)+P2(x181,x183)+P2(x184,x182)
% 1.03/1.12  %EqnAxiom
% 1.03/1.12  
% 1.03/1.12  %-------------------------------------------
% 1.03/1.12  cnf(23,plain,
% 1.03/1.12     (~P1(x231,x231)),
% 1.03/1.12     inference(rename_variables,[],[7])).
% 1.03/1.12  cnf(28,plain,
% 1.03/1.12     (P4(a1,a2)),
% 1.03/1.12     inference(scs_inference,[],[1,2,5,6,7,23,8,11,13,10])).
% 1.03/1.12  cnf(31,plain,
% 1.03/1.12     (~P2(a3,f5(f4(a1,a2),a3))),
% 1.03/1.12     inference(scs_inference,[],[5,2,14,8])).
% 1.03/1.12  cnf(32,plain,
% 1.03/1.12     (~P2(f4(a1,a2),f5(f4(a1,a2),a3))),
% 1.03/1.12     inference(scs_inference,[],[5,2,15,8])).
% 1.03/1.12  cnf(33,plain,
% 1.03/1.12     (~P2(f4(a1,a2),a2)),
% 1.03/1.12     inference(scs_inference,[],[1,6,16,11])).
% 1.03/1.12  cnf(48,plain,
% 1.03/1.12     (~P2(f4(a1,a2),a1)),
% 1.03/1.12     inference(scs_inference,[],[1,6,17,12])).
% 1.03/1.12  cnf(60,plain,
% 1.03/1.12     (~P4(a1,f5(f4(a1,a2),a3))),
% 1.03/1.12     inference(scs_inference,[],[2,5,32,31,3,48,8,18])).
% 1.03/1.12  cnf(62,plain,
% 1.03/1.12     (P4(a2,f5(f4(a1,a2),a3))),
% 1.03/1.12     inference(scs_inference,[],[60,28,10])).
% 1.03/1.12  cnf(98,plain,
% 1.03/1.12     ($false),
% 1.03/1.12     inference(scs_inference,[],[2,5,32,31,4,33,62,8,18]),
% 1.03/1.12     ['proof']).
% 1.03/1.12  % SZS output end Proof
% 1.03/1.12  % Total time :0.490000s
%------------------------------------------------------------------------------