↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO036-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% 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 : Tue May  5 04:19:05 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.71s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  14 unt;   4 nHn;  14 RR)
%            Number of literals    :   29 (  14 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   27 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity_for_equidistance,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).

cnf(segment_construction2,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).

cnf(lower_dimension2,axiom,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',lower_dimension2) ).

cnf(prove_axioms_points_are_distinct,negated_conjecture,
    ( lower_dimension_point_1 = lower_dimension_point_2
    | lower_dimension_point_2 = lower_dimension_point_3
    | lower_dimension_point_1 = lower_dimension_point_3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_axioms_points_are_distinct) ).

cnf(segment_construction1,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).

cnf(lower_dimension1,axiom,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',lower_dimension1) ).

cnf(lower_dimension3,axiom,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',lower_dimension3) ).

cnf(c_0_7,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    identity_for_equidistance ).

cnf(c_0_8,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    segment_construction2 ).

cnf(c_0_9,axiom,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    lower_dimension2 ).

cnf(c_0_10,negated_conjecture,
    ( lower_dimension_point_1 = lower_dimension_point_2
    | lower_dimension_point_2 = lower_dimension_point_3
    | lower_dimension_point_1 = lower_dimension_point_3 ),
    prove_axioms_points_are_distinct ).

cnf(c_0_11,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    segment_construction1 ).

cnf(c_0_12,plain,
    extension(X1,X2,X3,X3) = X2,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ( lower_dimension_point_3 = lower_dimension_point_2
    | lower_dimension_point_1 = lower_dimension_point_2
    | ~ between(lower_dimension_point_2,lower_dimension_point_1,lower_dimension_point_1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    between(X1,X2,X2),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,axiom,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    lower_dimension1 ).

cnf(c_0_16,negated_conjecture,
    ( lower_dimension_point_1 = lower_dimension_point_2
    | lower_dimension_point_3 = lower_dimension_point_2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_17,axiom,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    lower_dimension3 ).

cnf(c_0_18,negated_conjecture,
    lower_dimension_point_1 = lower_dimension_point_2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).

cnf(c_0_19,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GEO036-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.32  % Computer : n027.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Mon May  4 17:37:20 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.24/1.71  % Version  : CSE_E---1.7
% 1.24/1.71  % Problem  : theBenchmark.p
% 1.24/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71  % SZS output start CNFRefutation
% See solution above
% 1.24/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------