↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n001.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:30 PM UTC 2026

% Result   : Theorem 0.21s 0.47s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   47 (  26 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   68 (  20   ~;  17   |;  26   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-8 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   53 (   0 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(exemplo6GDDFULL416041,conjecture,
    ! [X1,X2,X3,X19,X18,X20,X16] :
      ( ( coll(X16,X1,X19)
        & perp(X16,X2,X1,X19)
        & coll(X20,X2,X3)
        & perp(X20,X19,X2,X3)
        & coll(X18,X1,X3)
        & perp(X18,X19,X1,X3)
        & eqangle(X19,X3,X3,X1,X19,X3,X3,X2)
        & eqangle(X19,X2,X2,X3,X19,X2,X2,X1)
        & eqangle(X19,X1,X1,X2,X19,X1,X1,X3) )
     => coll(X16,X18,X20) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exemplo6GDDFULL416041) ).

fof(ruleD1,axiom,
    ! [X1,X2,X3] :
      ( coll(X1,X2,X3)
     => coll(X1,X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD1) ).

fof(ruleD3,axiom,
    ! [X1,X2,X3,X4] :
      ( ( coll(X1,X2,X4)
        & coll(X1,X2,X3) )
     => coll(X3,X4,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD3) ).

fof(ruleD2,axiom,
    ! [X1,X2,X3] :
      ( coll(X1,X2,X3)
     => coll(X2,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO012+0.ax',ruleD2) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3,X19,X18,X20,X16] :
        ( ( coll(X16,X1,X19)
          & perp(X16,X2,X1,X19)
          & coll(X20,X2,X3)
          & perp(X20,X19,X2,X3)
          & coll(X18,X1,X3)
          & perp(X18,X19,X1,X3)
          & eqangle(X19,X3,X3,X1,X19,X3,X3,X2)
          & eqangle(X19,X2,X2,X3,X19,X2,X2,X1)
          & eqangle(X19,X1,X1,X2,X19,X1,X1,X3) )
       => coll(X16,X18,X20) ),
    inference(assume_negation,[status(cth)],[exemplo6GDDFULL416041]) ).

fof(c_0_5,plain,
    ! [X28,X29,X30] :
      ( coll(X28,X30,X29)
      | ~ coll(X28,X29,X30) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD1])])]) ).

fof(c_0_6,negated_conjecture,
    ( ~ coll(esk7_0,esk5_0,esk6_0)
    & coll(esk7_0,esk1_0,esk4_0)
    & perp(esk7_0,esk2_0,esk1_0,esk4_0)
    & coll(esk6_0,esk2_0,esk3_0)
    & perp(esk6_0,esk4_0,esk2_0,esk3_0)
    & coll(esk5_0,esk1_0,esk3_0)
    & perp(esk5_0,esk4_0,esk1_0,esk3_0)
    & eqangle(esk4_0,esk3_0,esk3_0,esk1_0,esk4_0,esk3_0,esk3_0,esk2_0)
    & eqangle(esk4_0,esk2_0,esk2_0,esk3_0,esk4_0,esk2_0,esk2_0,esk1_0)
    & eqangle(esk4_0,esk1_0,esk1_0,esk2_0,esk4_0,esk1_0,esk1_0,esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_7,plain,
    ! [X34,X35,X36,X37] :
      ( coll(X36,X37,X34)
      | ~ coll(X34,X35,X37)
      | ~ coll(X34,X35,X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD3])])]) ).

fof(c_0_8,plain,
    ! [X31,X32,X33] :
      ( coll(X32,X31,X33)
      | ~ coll(X31,X32,X33) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD2])])]) ).

cnf(c_0_9,plain,
    ( ~ coll(X1,X2,X3)
    | coll(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    coll(esk5_0,esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ coll(X1,X2,X4)
    | ~ coll(X1,X2,X3)
    | coll(X3,X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( ~ coll(X1,X2,X3)
    | coll(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    coll(esk5_0,esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ coll(esk5_0,esk1_0,X1)
    | coll(X1,esk3_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    coll(esk6_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    coll(esk3_0,esk5_0,esk1_0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    coll(esk3_0,esk3_0,esk5_0),
    inference(spm,[status(thm)],[c_0_14,c_0_10]) ).

cnf(c_0_18,negated_conjecture,
    coll(esk7_0,esk1_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ coll(esk6_0,esk2_0,X1)
    | coll(X1,esk3_0,esk6_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ coll(esk3_0,esk5_0,X1)
    | coll(X1,esk1_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    coll(esk3_0,esk5_0,esk3_0),
    inference(spm,[status(thm)],[c_0_9,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    coll(esk7_0,esk4_0,esk1_0),
    inference(spm,[status(thm)],[c_0_9,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    coll(esk3_0,esk3_0,esk6_0),
    inference(spm,[status(thm)],[c_0_19,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    coll(esk3_0,esk1_0,esk3_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ coll(esk7_0,esk4_0,X1)
    | coll(X1,esk1_0,esk7_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    coll(esk1_0,esk5_0,esk3_0),
    inference(spm,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ coll(esk3_0,esk3_0,X1)
    | coll(X1,esk6_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    coll(esk3_0,esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_9,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    coll(esk1_0,esk1_0,esk7_0),
    inference(spm,[status(thm)],[c_0_25,c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ coll(esk5_0,esk3_0,X1)
    | coll(X1,esk1_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

cnf(c_0_31,negated_conjecture,
    coll(esk1_0,esk3_0,esk5_0),
    inference(spm,[status(thm)],[c_0_9,c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    coll(esk1_0,esk6_0,esk3_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ coll(esk1_0,esk1_0,X1)
    | coll(X1,esk7_0,esk1_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    coll(esk1_0,esk1_0,esk5_0),
    inference(spm,[status(thm)],[c_0_30,c_0_13]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ coll(esk1_0,esk3_0,X1)
    | coll(X1,esk5_0,esk1_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    coll(esk1_0,esk3_0,esk6_0),
    inference(spm,[status(thm)],[c_0_9,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    coll(esk5_0,esk7_0,esk1_0),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    coll(esk6_0,esk5_0,esk1_0),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    coll(esk5_0,esk1_0,esk7_0),
    inference(spm,[status(thm)],[c_0_9,c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    coll(esk5_0,esk6_0,esk1_0),
    inference(spm,[status(thm)],[c_0_12,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ coll(esk5_0,esk1_0,X1)
    | coll(X1,esk7_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    coll(esk5_0,esk1_0,esk6_0),
    inference(spm,[status(thm)],[c_0_9,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    coll(esk6_0,esk7_0,esk5_0),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_44,negated_conjecture,
    coll(esk7_0,esk6_0,esk5_0),
    inference(spm,[status(thm)],[c_0_12,c_0_43]) ).

cnf(c_0_45,negated_conjecture,
    ~ coll(esk7_0,esk5_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_44]),c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO579+1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 17:42:57 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.21/0.47  % Version: 3.5.1
% 0.21/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.47  % Starting sh5l with 300s (1) cores
% 0.21/0.47  % new_bool_3 with pid 1080124 completed with status 0
% 0.21/0.47  % Result found by new_bool_3
% 0.21/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47  % Search class: FGUNF-FFMM33-SFFFFFNN
% 0.21/0.47  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.47  % SubtermCWHack with pid 1080132 completed with status 0
% 0.21/0.47  % Result found by SubtermCWHack
% 0.21/0.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47  % Search class: FGUNF-FFMM33-SFFFFFNN
% 0.21/0.47  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.47  % Preprocessing time       : 0.002 s
% 0.21/0.47  
% 0.21/0.47  % Proof found!
% 0.21/0.47  % SZS status Theorem
% 0.21/0.47  % SZS output start CNFRefutation
% See solution above
% 0.21/0.47  % Parsed axioms                        : 95
% 0.21/0.47  % Removed by relevancy pruning/SinE    : 43
% 0.21/0.47  % Initial clauses                      : 76
% 0.21/0.47  % Removed in clause preprocessing      : 0
% 0.21/0.47  % Initial clauses in saturation        : 76
% 0.21/0.47  % Processed clauses                    : 512
% 0.21/0.47  % ...of these trivial                  : 38
% 0.21/0.47  % ...subsumed                          : 0
% 0.21/0.47  % ...remaining for further processing  : 474
% 0.21/0.47  % Other redundant clauses eliminated   : 0
% 0.21/0.47  % Clauses deleted for lack of memory   : 0
% 0.21/0.47  % Backward-subsumed                    : 0
% 0.21/0.47  % Backward-rewritten                   : 0
% 0.21/0.47  % Generated clauses                    : 2212
% 0.21/0.47  % ...of the previous two non-redundant : 1374
% 0.21/0.47  % ...aggressively subsumed             : 0
% 0.21/0.47  % Contextual simplify-reflections      : 0
% 0.21/0.47  % Paramodulations                      : 2212
% 0.21/0.47  % Factorizations                       : 0
% 0.21/0.47  % NegExts                              : 0
% 0.21/0.47  % Equation resolutions                 : 0
% 0.21/0.47  % Disequality decompositions           : 0
% 0.21/0.47  % Total rewrite steps                  : 871
% 0.21/0.47  % ...of those cached                   : 527
% 0.21/0.47  % Propositional unsat checks           : 0
% 0.21/0.47  %    Propositional check models        : 0
% 0.21/0.47  %    Propositional check unsatisfiable : 0
% 0.21/0.47  %    Propositional clauses             : 0
% 0.21/0.47  %    Propositional clauses after purity: 0
% 0.21/0.47  %    Propositional unsat core size     : 0
% 0.21/0.47  %    Propositional preprocessing time  : 0.000
% 0.21/0.47  %    Propositional encoding time       : 0.000
% 0.21/0.47  %    Propositional solver time         : 0.000
% 0.21/0.47  %    Success case prop preproc time    : 0.000
% 0.21/0.47  %    Success case prop encoding time   : 0.000
% 0.21/0.47  %    Success case prop solver time     : 0.000
% 0.21/0.47  % Current number of processed clauses  : 474
% 0.21/0.47  %    Positive orientable unit clauses  : 350
% 0.21/0.47  %    Positive unorientable unit clauses: 0
% 0.21/0.47  %    Negative unit clauses             : 1
% 0.21/0.47  %    Non-unit-clauses                  : 123
% 0.21/0.47  % Current number of unprocessed clauses: 938
% 0.21/0.47  % ...number of literals in the above   : 2956
% 0.21/0.47  % Current number of archived formulas  : 0
% 0.21/0.47  % Current number of archived clauses   : 0
% 0.21/0.47  % Clause-clause subsumption calls (NU) : 1510
% 0.21/0.47  % Rec. Clause-clause subsumption calls : 1305
% 0.21/0.47  % Non-unit clause-clause subsumptions  : 0
% 0.21/0.47  % Unit Clause-clause subsumption calls : 1336
% 0.21/0.47  % Rewrite failures with RHS unbound    : 0
% 0.21/0.47  % BW rewrite match attempts            : 1048
% 0.21/0.47  % BW rewrite match successes           : 0
% 0.21/0.47  % Condensation attempts                : 0
% 0.21/0.47  % Condensation successes               : 0
% 0.21/0.47  % Termbank termtop insertions          : 30587
% 0.21/0.47  % Search garbage collected termcells   : 2129
% 0.21/0.47  
% 0.21/0.47  % -------------------------------------------------
% 0.21/0.47  % User time                : 0.037 s
% 0.21/0.47  % System time              : 0.004 s
% 0.21/0.47  % Total time               : 0.041 s
% 0.21/0.47  % Maximum resident set size: 4048 pages
% 0.21/0.47  
% 0.21/0.47  % -------------------------------------------------
% 0.21/0.47  % User time                : 0.042 s
% 0.21/0.47  % System time              : 0.008 s
% 0.21/0.47  % Total time               : 0.050 s
% 0.21/0.47  % Maximum resident set size: 4864 pages
% 0.21/0.47  % E exiting
%------------------------------------------------------------------------------