↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO343+1 : TPTP v9.2.1. Released v4.1.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 : n015.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.94s 1.92s
% Output   : CNFRefutation 1.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (  15 unt;   0 def)
%            Number of atoms       :  119 (  44 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  143 (  51   ~;  44   |;  45   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;  10 con; 0-0 aty)
%            Number of variables   :   36 (   0 sgn  14   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
    ! [X232,X233,X234,X235] :
      ( ( ron(X233,X235)
        & ron(X233,X234)
        & ron(X232,X235)
        & ron(X232,X234)
        & ? [X236] :
            ( X235 = X236
            & rline(X236) )
        & ? [X237] :
            ( X234 = X237
            & rline(X237) )
        & X232 != X233
        & ? [X238] :
            ( X233 = X238
            & rpoint(X238) )
        & ? [X239] :
            ( X232 = X239
            & rpoint(X239) ) )
     => X234 = X235 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).

fof('qu(theu(the(408), 1), imp(the(408)))',conjecture,
    ! [X1] :
      ( ( ron(vd1399,X1)
        & ron(vd1401,X1)
        & rline(X1) )
     => X1 = vd1416 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(408), 1), imp(the(408)))') ).

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/sandbox/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('and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))',axiom,
    ( ron(vd1399,vd1416)
    & ron(vd1401,vd1416)
    & rline(vd1416) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))') ).

fof(c_0_4,plain,
    ! [X1918,X1919,X1920,X1921,X1922,X1923,X1924,X1925] :
      ( ~ ron(X1919,X1921)
      | ~ ron(X1919,X1920)
      | ~ ron(X1918,X1921)
      | ~ ron(X1918,X1920)
      | X1921 != X1922
      | ~ rline(X1922)
      | X1920 != X1923
      | ~ rline(X1923)
      | X1918 = X1919
      | X1919 != X1924
      | ~ rpoint(X1924)
      | X1918 != X1925
      | ~ rpoint(X1925)
      | X1920 = X1921 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))'])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( ron(vd1399,X1)
          & ron(vd1401,X1)
          & rline(X1) )
       => X1 = vd1416 ),
    inference(assume_negation,[status(cth)],['qu(theu(the(408), 1), imp(the(408)))']) ).

fof(c_0_6,plain,
    ( vd1406 = vd1407
    & ron(vd1400,vd1406)
    & ron(vd1399,vd1406)
    & rline(vd1407)
    & vd1400 != vd1401
    & vd1399 != vd1401
    & vd1399 != vd1400
    & vd1401 = esk2_0
    & rpoint(esk2_0)
    & vd1400 = esk3_0
    & rpoint(esk3_0)
    & vd1399 = esk4_0
    & rpoint(esk4_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_7,plain,
    ( X4 = X1
    | X3 = X2
    | ~ ron(X1,X2)
    | ~ ron(X1,X3)
    | ~ ron(X4,X2)
    | ~ ron(X4,X3)
    | X2 != X5
    | ~ rline(X5)
    | X3 != X6
    | ~ rline(X6)
    | X1 != X7
    | ~ rpoint(X7)
    | X4 != X8
    | ~ rpoint(X8) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ( ron(vd1399,esk1_0)
    & ron(vd1401,esk1_0)
    & rline(esk1_0)
    & esk1_0 != vd1416 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    rpoint(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    vd1401 = esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | X3 = X4
    | ~ rpoint(X4)
    | ~ rpoint(X3)
    | ~ rline(X2)
    | ~ rline(X1)
    | ~ ron(X4,X2)
    | ~ ron(X4,X1)
    | ~ ron(X3,X2)
    | ~ ron(X3,X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_12,negated_conjecture,
    ron(vd1401,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    rpoint(vd1401),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    rline(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    ( X1 = esk1_0
    | X2 = vd1401
    | ~ rpoint(X2)
    | ~ rline(X1)
    | ~ ron(vd1401,X1)
    | ~ ron(X2,esk1_0)
    | ~ ron(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_16,plain,
    ron(vd1401,vd1416),
    inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).

cnf(c_0_17,plain,
    rline(vd1416),
    inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).

cnf(c_0_18,negated_conjecture,
    esk1_0 != vd1416,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,plain,
    rpoint(esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,plain,
    vd1399 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_21,negated_conjecture,
    ( X1 = vd1401
    | ~ rpoint(X1)
    | ~ ron(X1,esk1_0)
    | ~ ron(X1,vd1416) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ron(vd1399,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_23,plain,
    rpoint(vd1399),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ron(vd1399,vd1416),
    inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).

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

cnf(c_0_26,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_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GEO343+1 : TPTP v9.2.1. Released v4.1.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.33  % Computer : n015.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 17:55:17 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.94/1.92  % Version  : CSE_E---1.7
% 1.94/1.92  % Problem  : theBenchmark.p
% 1.94/1.92  % SZS status Theorem for theBenchmark.p
% 1.94/1.92  % SZS output start CNFRefutation
% See solution above
% 1.94/1.92  % Total time : 1.424s
%------------------------------------------------------------------------------