↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO342+1 : TPTP v9.2.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n004.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:20:20 PM UTC 2026

% Result   : Theorem 1.79s 1.89s
% Output   : CNFRefutation 1.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :  110 (  43 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  137 (  51   ~;  49   |;  36   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn   7   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('qe(thee(the(408), 1))',conjecture,
    ? [X1] :
      ( ron(vd1399,X1)
      & ron(vd1401,X1)
      & rline(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(thee(the(408), 1))') ).

fof('qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))',axiom,
    ! [X123,X124] :
      ( ( X123 != X124
        & ? [X125] :
            ( X124 = X125
            & rpoint(X125) )
        & ? [X126] :
            ( X123 = X126
            & rpoint(X126) ) )
     => ? [X127] :
          ( ron(X124,X127)
          & ron(X123,X127)
          & rline(X127) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))') ).

fof('and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))',axiom,
    ( vd1406 = vd1407
    & ron(vd1400,vd1406)
    & ron(vd1399,vd1406)
    & rline(vd1407)
    & vd1400 != vd1401
    & vd1399 != vd1401
    & vd1399 != vd1400
    & ? [X2] :
        ( vd1401 = X2
        & rpoint(X2) )
    & ? [X3] :
        ( vd1400 = X3
        & rpoint(X3) )
    & ? [X4] :
        ( vd1399 = X4
        & rpoint(X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] :
        ( ron(vd1399,X1)
        & ron(vd1401,X1)
        & rline(X1) ),
    inference(assume_negation,[status(cth)],['qe(thee(the(408), 1))']) ).

fof(c_0_4,plain,
    ! [X1809,X1810,X1811,X1812] :
      ( ( ron(X1810,esk8_2(X1809,X1810))
        | X1809 = X1810
        | X1810 != X1811
        | ~ rpoint(X1811)
        | X1809 != X1812
        | ~ rpoint(X1812) )
      & ( ron(X1809,esk8_2(X1809,X1810))
        | X1809 = X1810
        | X1810 != X1811
        | ~ rpoint(X1811)
        | X1809 != X1812
        | ~ rpoint(X1812) )
      & ( rline(esk8_2(X1809,X1810))
        | X1809 = X1810
        | X1810 != X1811
        | ~ rpoint(X1811)
        | X1809 != X1812
        | ~ rpoint(X1812) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))'])])])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X1621] :
      ( ~ ron(vd1399,X1621)
      | ~ ron(vd1401,X1621)
      | ~ rline(X1621) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

cnf(c_0_6,plain,
    ( rline(esk8_2(X1,X2))
    | X1 = X2
    | X2 != X3
    | ~ rpoint(X3)
    | X1 != X4
    | ~ rpoint(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ( vd1406 = vd1407
    & ron(vd1400,vd1406)
    & ron(vd1399,vd1406)
    & rline(vd1407)
    & vd1400 != vd1401
    & vd1399 != vd1401
    & vd1399 != vd1400
    & vd1401 = esk1_0
    & rpoint(esk1_0)
    & vd1400 = esk2_0
    & rpoint(esk2_0)
    & vd1399 = esk3_0
    & rpoint(esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))'])]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ ron(vd1399,X1)
    | ~ ron(vd1401,X1)
    | ~ rline(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | rline(esk8_2(X1,X2))
    | ~ rpoint(X1)
    | ~ rpoint(X2) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).

cnf(c_0_10,plain,
    ( ron(X1,esk8_2(X1,X2))
    | X1 = X2
    | X2 != X3
    | ~ rpoint(X3)
    | X1 != X4
    | ~ rpoint(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,plain,
    rpoint(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    vd1399 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    ( X1 = X2
    | ~ rpoint(X1)
    | ~ rpoint(X2)
    | ~ ron(vd1399,esk8_2(X1,X2))
    | ~ ron(vd1401,esk8_2(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( X1 = X2
    | ron(X1,esk8_2(X1,X2))
    | ~ rpoint(X1)
    | ~ rpoint(X2) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).

cnf(c_0_15,plain,
    rpoint(vd1399),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( ron(X1,esk8_2(X2,X1))
    | X2 = X1
    | X1 != X3
    | ~ rpoint(X3)
    | X2 != X4
    | ~ rpoint(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_17,plain,
    rpoint(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    vd1401 = esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    ( vd1399 = X1
    | ~ rpoint(X1)
    | ~ ron(vd1401,esk8_2(vd1399,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | ron(X1,esk8_2(X2,X1))
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).

cnf(c_0_21,plain,
    rpoint(vd1401),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    vd1399 != vd1401,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_15])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GEO342+1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n004.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 17:53:17 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.79/1.89  % Version  : CSE_E---1.7
% 1.79/1.89  % Problem  : theBenchmark.p
% 1.79/1.89  % SZS status Theorem for theBenchmark.p
% 1.79/1.89  % SZS output start CNFRefutation
% See solution above
% 1.89/1.90  % Total time : 1.424s
%------------------------------------------------------------------------------