↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO299+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:28:07 PM UTC 2026

% Result   : Theorem 0.27s 0.56s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  24 unt;   0 def)
%            Number of atoms       :  127 (  68 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  130 (  38   ~;  21   |;  70   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   19 (  19 usr;  16 con; 0-3 aty)
%            Number of variables   :   38 (   0 sgn  10   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('holds(324, 1255, 0)',conjecture,
    vf(vd1185,vd1187) = vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(324, 1255, 0)') ).

fof('qe(s1(plural(271)))',axiom,
    ? [X16] :
      ( rpoint(X16)
      & vd1199 = X16 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s1(plural(271)))') ).

fof('and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))',axiom,
    ( ? [X23] :
        ( rpoint(X23)
        & vd1178 = X23 )
    & ? [X22] :
        ( rpoint(X22)
        & vd1179 = X22 )
    & ? [X21] :
        ( rpoint(X21)
        & vd1180 = X21 )
    & vd1178 != vd1179
    & vd1178 != vd1180
    & vd1179 != vd1180
    & ? [X20] :
        ( rpoint(X20)
        & vd1185 = X20 )
    & ? [X19] :
        ( rpoint(X19)
        & vd1186 = X19 )
    & ? [X18] :
        ( rpoint(X18)
        & vd1187 = X18 )
    & vf(vd1178,vd1179) = vf(vd1185,vd1186)
    & vf(vd1178,vd1180) = vf(vd1185,vd1187)
    & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
    & ~ ? [X17] :
          ( rline(X17)
          & ron(vd1185,X17)
          & ron(vd1186,X17)
          & ron(vd1187,X17) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).

fof('holds(314, 1247, 0)',axiom,
    vf(vd1199,vd1201) = vf(vd1185,vd1187),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(314, 1247, 0)') ).

fof('holds(291, 1230, 0)',axiom,
    vd1199 = vd1185,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(291, 1230, 0)') ).

fof('qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))',axiom,
    ! [X1,X2,X3] :
      ( ( ? [X6] :
            ( rpoint(X6)
            & X1 = X6 )
        & ? [X5] :
            ( rpoint(X5)
            & X2 = X5 )
        & ? [X4] :
            ( rpoint(X4)
            & X3 = X4 )
        & rR(X2,X1,X3) )
     => vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))') ).

fof('qe(s3(plural(271)))',axiom,
    ? [X15] :
      ( rpoint(X15)
      & vd1201 = X15 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(271)))') ).

fof('holds(323, 1254, 0)',axiom,
    rR(vd1201,vd1185,vd1187),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(323, 1254, 0)') ).

fof(c_0_8,negated_conjecture,
    vf(vd1185,vd1187) != vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
    inference(assume_negation,[status(cth)],['holds(324, 1255, 0)']) ).

fof(c_0_9,negated_conjecture,
    vf(vd1185,vd1187) != vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_10,plain,
    ( rpoint(esk2_0)
    & vd1199 = esk2_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(271)))'])]) ).

fof(c_0_11,plain,
    ( ? [X23] :
        ( rpoint(X23)
        & vd1178 = X23 )
    & ? [X22] :
        ( rpoint(X22)
        & vd1179 = X22 )
    & ? [X21] :
        ( rpoint(X21)
        & vd1180 = X21 )
    & vd1178 != vd1179
    & vd1178 != vd1180
    & vd1179 != vd1180
    & ? [X20] :
        ( rpoint(X20)
        & vd1185 = X20 )
    & ? [X19] :
        ( rpoint(X19)
        & vd1186 = X19 )
    & ? [X18] :
        ( rpoint(X18)
        & vd1187 = X18 )
    & vf(vd1178,vd1179) = vf(vd1185,vd1186)
    & vf(vd1178,vd1180) = vf(vd1185,vd1187)
    & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
    & ~ ? [X17] :
          ( rline(X17)
          & ron(vd1185,X17)
          & ron(vd1186,X17)
          & ron(vd1187,X17) ) ),
    inference(fof_simplification,[status(thm)],['and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))']) ).

fof(c_0_12,negated_conjecture,
    vf(vd1185,vd1187) != vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    vf(vd1199,vd1201) = vf(vd1185,vd1187),
    inference(split_conjunct,[status(thm)],['holds(314, 1247, 0)']) ).

cnf(c_0_14,plain,
    vd1199 = vd1185,
    inference(split_conjunct,[status(thm)],['holds(291, 1230, 0)']) ).

fof(c_0_15,plain,
    ! [X755,X756,X757,X758,X759,X760] :
      ( vplus(vf(X755,X756),vf(X756,X757)) = vf(X755,X757)
      | ~ rpoint(X760)
      | X755 != X760
      | ~ rpoint(X759)
      | X756 != X759
      | ~ rpoint(X758)
      | X757 != X758
      | ~ rR(X756,X755,X757) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))'])])])]) ).

cnf(c_0_16,plain,
    vd1199 = esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_17,plain,
    ( rpoint(esk1_0)
    & vd1201 = esk1_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).

fof(c_0_18,plain,
    ! [X771] :
      ( rpoint(esk8_0)
      & vd1178 = esk8_0
      & rpoint(esk7_0)
      & vd1179 = esk7_0
      & rpoint(esk6_0)
      & vd1180 = esk6_0
      & vd1178 != vd1179
      & vd1178 != vd1180
      & vd1179 != vd1180
      & rpoint(esk5_0)
      & vd1185 = esk5_0
      & rpoint(esk4_0)
      & vd1186 = esk4_0
      & rpoint(esk3_0)
      & vd1187 = esk3_0
      & vf(vd1178,vd1179) = vf(vd1185,vd1186)
      & vf(vd1178,vd1180) = vf(vd1185,vd1187)
      & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
      & ( ~ rline(X771)
        | ~ ron(vd1185,X771)
        | ~ ron(vd1186,X771)
        | ~ ron(vd1187,X771) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).

cnf(c_0_19,negated_conjecture,
    vf(vd1185,vd1187) != vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    vf(vd1185,vd1187) = vf(vd1185,vd1201),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( ~ rpoint(X6)
    | X2 != X6
    | ~ rpoint(X5)
    | X1 != X5
    | ~ rpoint(X4)
    | X3 != X4
    | ~ rR(X1,X2,X3)
    | vplus(vf(X2,X1),vf(X1,X3)) = vf(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    rpoint(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_23,plain,
    esk2_0 = vd1185,
    inference(rw,[status(thm)],[c_0_16,c_0_14]) ).

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

cnf(c_0_25,plain,
    vd1201 = esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_26,plain,
    rpoint(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,plain,
    vd1187 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)) != vf(vd1185,vd1201),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_29,plain,
    ( ~ rR(X2,X1,X3)
    | ~ rpoint(X3)
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])])]) ).

cnf(c_0_30,plain,
    rpoint(vd1185),
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_31,plain,
    rpoint(vd1201),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    rpoint(vd1187),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,plain,
    rR(vd1201,vd1185,vd1187),
    inference(split_conjunct,[status(thm)],['holds(323, 1254, 0)']) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_30]),c_0_31]),c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO299+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n005.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sun Sep 20 15:14:33 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.56  % Version: 3.5.1
% 0.27/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56  % Starting sh5l with 300s (1) cores
% 0.27/0.56  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1277390 completed with status 0
% 0.27/0.56  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.27/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56  % No SInE strategy applied
% 0.27/0.56  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.27/0.56  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.27/0.56  % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.27/0.56  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.27/0.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.27/0.56  % G-E--_302_C18_F1_URBAN_S0Y with pid 1277399 completed with status 0
% 0.27/0.56  % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.27/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56  % No SInE strategy applied
% 0.27/0.56  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.27/0.56  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.27/0.56  % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.27/0.56  % Preprocessing time       : 0.019 s
% 0.27/0.56  
% 0.27/0.56  % Proof found!
% 0.27/0.56  % SZS status Theorem
% 0.27/0.56  % SZS output start CNFRefutation
% See solution above
% 0.27/0.56  % Parsed axioms                        : 160
% 0.27/0.56  % Removed by relevancy pruning/SinE    : 0
% 0.27/0.56  % Initial clauses                      : 327
% 0.27/0.56  % Removed in clause preprocessing      : 2
% 0.27/0.56  % Initial clauses in saturation        : 325
% 0.27/0.56  % Processed clauses                    : 413
% 0.27/0.56  % ...of these trivial                  : 22
% 0.27/0.56  % ...subsumed                          : 13
% 0.27/0.56  % ...remaining for further processing  : 378
% 0.27/0.56  % Other redundant clauses eliminated   : 1112
% 0.27/0.56  % Clauses deleted for lack of memory   : 0
% 0.27/0.56  % Backward-subsumed                    : 1
% 0.27/0.56  % Backward-rewritten                   : 2
% 0.27/0.56  % Generated clauses                    : 353
% 0.27/0.56  % ...of the previous two non-redundant : 331
% 0.27/0.56  % ...aggressively subsumed             : 0
% 0.27/0.56  % Contextual simplify-reflections      : 2
% 0.27/0.56  % Paramodulations                      : 103
% 0.27/0.56  % Factorizations                       : 0
% 0.27/0.56  % NegExts                              : 0
% 0.27/0.56  % Equation resolutions                 : 1122
% 0.27/0.56  % Disequality decompositions           : 0
% 0.27/0.56  % Total rewrite steps                  : 140
% 0.27/0.56  % ...of those cached                   : 104
% 0.27/0.56  % Propositional unsat checks           : 0
% 0.27/0.56  %    Propositional check models        : 0
% 0.27/0.56  %    Propositional check unsatisfiable : 0
% 0.27/0.56  %    Propositional clauses             : 0
% 0.27/0.56  %    Propositional clauses after purity: 0
% 0.27/0.56  %    Propositional unsat core size     : 0
% 0.27/0.56  %    Propositional preprocessing time  : 0.000
% 0.27/0.56  %    Propositional encoding time       : 0.000
% 0.27/0.56  %    Propositional solver time         : 0.000
% 0.27/0.56  %    Success case prop preproc time    : 0.000
% 0.27/0.56  %    Success case prop encoding time   : 0.000
% 0.27/0.56  %    Success case prop solver time     : 0.000
% 0.27/0.56  % Current number of processed clauses  : 135
% 0.27/0.56  %    Positive orientable unit clauses  : 44
% 0.27/0.56  %    Positive unorientable unit clauses: 0
% 0.27/0.56  %    Negative unit clauses             : 18
% 0.27/0.56  %    Non-unit-clauses                  : 73
% 0.27/0.56  % Current number of unprocessed clauses: 233
% 0.27/0.56  % ...number of literals in the above   : 2128
% 0.27/0.56  % Current number of archived formulas  : 0
% 0.27/0.56  % Current number of archived clauses   : 3
% 0.27/0.56  % Clause-clause subsumption calls (NU) : 22443
% 0.27/0.56  % Rec. Clause-clause subsumption calls : 661
% 0.27/0.56  % Non-unit clause-clause subsumptions  : 9
% 0.27/0.56  % Unit Clause-clause subsumption calls : 196
% 0.27/0.56  % Rewrite failures with RHS unbound    : 0
% 0.27/0.56  % BW rewrite match attempts            : 2
% 0.27/0.56  % BW rewrite match successes           : 2
% 0.27/0.56  % Condensation attempts                : 0
% 0.27/0.56  % Condensation successes               : 0
% 0.27/0.56  % Termbank termtop insertions          : 65656
% 0.27/0.56  % Search garbage collected termcells   : 14344
% 0.27/0.56  
% 0.27/0.56  % -------------------------------------------------
% 0.27/0.56  % User time                : 0.116 s
% 0.27/0.56  % System time              : 0.013 s
% 0.27/0.56  % Total time               : 0.129 s
% 0.27/0.56  % Maximum resident set size: 6300 pages
% 0.27/0.56  
% 0.27/0.56  % -------------------------------------------------
% 0.27/0.56  % User time                : 0.375 s
% 0.27/0.56  % System time              : 0.039 s
% 0.27/0.56  % Total time               : 0.414 s
% 0.27/0.56  % Maximum resident set size: 5376 pages
% 0.27/0.56  % E exiting
%------------------------------------------------------------------------------