↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n002.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:27:18 PM UTC 2026

% Result   : Theorem 0.14s 5.45s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   3 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   35 (  15   ~;  13   |;   3   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(symmetry_of_at_the_same_time,axiom,
    ! [X14,X15] :
      ( once(at_the_same_time(X14,X15))
    <=> once(at_the_same_time(X15,X14)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',symmetry_of_at_the_same_time) ).

fof(connect_defn,axiom,
    ! [X12,X13,X3] :
      ( connect(X12,X13,X3)
    <=> once(at_the_same_time(at(X12,X3),at(X13,X3))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',connect_defn) ).

fof(t12,conjecture,
    ! [X12,X13,X3] :
      ( connect(X12,X13,X3)
    <=> connect(X13,X12,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12) ).

fof(c_0_3,plain,
    ! [X26,X27] :
      ( ( once(at_the_same_time(X26,X27))
        | ~ once(at_the_same_time(X27,X26)) )
      & ( once(at_the_same_time(X27,X26))
        | ~ once(at_the_same_time(X26,X27)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_of_at_the_same_time])])]) ).

fof(c_0_4,plain,
    ! [X23,X24,X25] :
      ( ( connect(X23,X24,X25)
        | ~ once(at_the_same_time(at(X23,X25),at(X24,X25))) )
      & ( once(at_the_same_time(at(X23,X25),at(X24,X25)))
        | ~ connect(X23,X24,X25) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connect_defn])])]) ).

cnf(c_0_5,plain,
    ( ~ once(at_the_same_time(X1,X2))
    | once(at_the_same_time(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( ~ connect(X1,X2,X3)
    | once(at_the_same_time(at(X1,X3),at(X2,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X12,X13,X3] :
        ( connect(X12,X13,X3)
      <=> connect(X13,X12,X3) ),
    inference(assume_negation,[status(cth)],[t12]) ).

cnf(c_0_8,plain,
    ( ~ once(at_the_same_time(at(X1,X2),at(X3,X2)))
    | connect(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    ( ~ connect(X3,X1,X2)
    | once(at_the_same_time(at(X1,X2),at(X3,X2))) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

fof(c_0_10,negated_conjecture,
    ( ( connect(esk2_0,esk1_0,esk3_0)
      | connect(esk1_0,esk2_0,esk3_0) )
    & ( ~ connect(esk2_0,esk1_0,esk3_0)
      | ~ connect(esk1_0,esk2_0,esk3_0) ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_11,plain,
    ( ~ connect(X2,X1,X3)
    | connect(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( connect(esk2_0,esk1_0,esk3_0)
    | connect(esk1_0,esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ connect(esk2_0,esk1_0,esk3_0)
    | ~ connect(esk1_0,esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    connect(esk1_0,esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ~ connect(esk2_0,esk1_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO146+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37  % Computer : n002.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Sun Sep 20 12:29:53 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  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.14/5.45  % Version: 3.5.1
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45  % Starting sh5l with 300s (1) cores
% 0.14/5.45  % new_bool_3 with pid 949690 completed with status 0
% 0.14/5.45  % Result found by new_bool_3
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45  % Search class: FGHSF-FFMF21-MFFFFFNN
% 0.14/5.45  % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.14/5.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45  % SubtermCWHack with pid 949693 completed with status 0
% 0.14/5.45  % Result found by SubtermCWHack
% 0.14/5.45  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45  % Search class: FGHSF-FFMF21-MFFFFFNN
% 0.14/5.45  % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.14/5.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45  % Preprocessing time       : 0.002 s
% 0.14/5.45  
% 0.14/5.45  % Proof found!
% 0.14/5.45  % SZS status Theorem
% 0.14/5.45  % SZS output start CNFRefutation
% See solution above
% 0.14/5.45  % Parsed axioms                        : 37
% 0.14/5.45  % Removed by relevancy pruning/SinE    : 25
% 0.14/5.45  % Initial clauses                      : 20
% 0.14/5.45  % Removed in clause preprocessing      : 0
% 0.14/5.45  % Initial clauses in saturation        : 20
% 0.14/5.45  % Processed clauses                    : 213
% 0.14/5.45  % ...of these trivial                  : 0
% 0.14/5.45  % ...subsumed                          : 149
% 0.14/5.45  % ...remaining for further processing  : 63
% 0.14/5.45  % Other redundant clauses eliminated   : 0
% 0.14/5.45  % Clauses deleted for lack of memory   : 0
% 0.14/5.45  % Backward-subsumed                    : 0
% 0.14/5.45  % Backward-rewritten                   : 2
% 0.14/5.45  % Generated clauses                    : 357
% 0.14/5.45  % ...of the previous two non-redundant : 333
% 0.14/5.45  % ...aggressively subsumed             : 0
% 0.14/5.45  % Contextual simplify-reflections      : 2
% 0.14/5.45  % Paramodulations                      : 355
% 0.14/5.45  % Factorizations                       : 2
% 0.14/5.45  % NegExts                              : 0
% 0.14/5.45  % Equation resolutions                 : 0
% 0.14/5.45  % Disequality decompositions           : 0
% 0.14/5.45  % Total rewrite steps                  : 4
% 0.14/5.45  % ...of those cached                   : 1
% 0.14/5.45  % Propositional unsat checks           : 0
% 0.14/5.45  %    Propositional check models        : 0
% 0.14/5.45  %    Propositional check unsatisfiable : 0
% 0.14/5.45  %    Propositional clauses             : 0
% 0.14/5.45  %    Propositional clauses after purity: 0
% 0.14/5.45  %    Propositional unsat core size     : 0
% 0.14/5.45  %    Propositional preprocessing time  : 0.000
% 0.14/5.45  %    Propositional encoding time       : 0.000
% 0.14/5.45  %    Propositional solver time         : 0.000
% 0.14/5.45  %    Success case prop preproc time    : 0.000
% 0.14/5.45  %    Success case prop encoding time   : 0.000
% 0.14/5.45  %    Success case prop solver time     : 0.000
% 0.14/5.45  % Current number of processed clauses  : 61
% 0.14/5.45  %    Positive orientable unit clauses  : 4
% 0.14/5.45  %    Positive unorientable unit clauses: 0
% 0.14/5.45  %    Negative unit clauses             : 1
% 0.14/5.45  %    Non-unit-clauses                  : 56
% 0.14/5.45  % Current number of unprocessed clauses: 140
% 0.14/5.45  % ...number of literals in the above   : 302
% 0.14/5.45  % Current number of archived formulas  : 0
% 0.14/5.45  % Current number of archived clauses   : 2
% 0.14/5.45  % Clause-clause subsumption calls (NU) : 1101
% 0.14/5.45  % Rec. Clause-clause subsumption calls : 1064
% 0.14/5.45  % Non-unit clause-clause subsumptions  : 151
% 0.14/5.45  % Unit Clause-clause subsumption calls : 5
% 0.14/5.45  % Rewrite failures with RHS unbound    : 0
% 0.14/5.45  % BW rewrite match attempts            : 1
% 0.14/5.45  % BW rewrite match successes           : 1
% 0.14/5.45  % Condensation attempts                : 0
% 0.14/5.45  % Condensation successes               : 0
% 0.14/5.45  % Termbank termtop insertions          : 5282
% 0.14/5.45  % Search garbage collected termcells   : 549
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.009 s
% 0.14/5.45  % System time              : 0.004 s
% 0.14/5.45  % Total time               : 0.013 s
% 0.14/5.45  % Maximum resident set size: 3696 pages
% 0.14/5.45  
% 0.14/5.45  % -------------------------------------------------
% 0.14/5.45  % User time                : 0.012 s
% 0.14/5.45  % System time              : 0.008 s
% 0.14/5.45  % Total time               : 0.020 s
% 0.14/5.45  % Maximum resident set size: 4864 pages
% 0.14/5.45  % E exiting
%------------------------------------------------------------------------------