↑ Up

E-SAT---3.5.1.THM-CRf.s

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

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

% Result   : Theorem 15.34s 17.48s
% Output   : CNFRefutation 15.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   44 (  17 unt;   0 def)
%            Number of atoms       :  116 (  56 equ)
%            Maximal formula atoms :   18 (   2 avg)
%            Number of connectives :  127 (  55   ~;  60   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :  119 (   7 sgn  72   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(aSatz6_11a,conjecture,
    ! [X27,X12,X15,X14] :
      ( ( s_e(X12,insert(X15,X14,X12,X27),X15,X14)
        | X15 = X14
        | X27 = X12 )
      & ( sameside(insert(X15,X14,X12,X27),X12,X27)
        | X15 = X14
        | X27 = X12 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz6_11a) ).

fof(aSatz6_2a,axiom,
    ! [X12,X13,X15,X14] :
      ( sameside(X12,X13,X15)
      | ~ s_t(X15,X13,X14)
      | ~ s_t(X12,X13,X14)
      | X14 = X13
      | X15 = X13
      | X12 = X13 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz6_2a) ).

fof(aSatz3_2,axiom,
    ! [X12,X15,X14] :
      ( s_t(X14,X15,X12)
      | ~ s_t(X12,X15,X14) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz3_2) ).

fof(d_insert,axiom,
    ! [X12,X15,X20,X22] : insert(X12,X15,X20,X22) = ext(ext(X22,X20,alpha,gamma),X20,X12,X15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_insert) ).

fof(aA4,axiom,
    ! [X1,X2,X7,X4] :
      ( s_e(X2,ext(X1,X2,X7,X4),X7,X4)
      & s_t(X1,X2,ext(X1,X2,X7,X4)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA4) ).

fof(aSatz2_2,axiom,
    ! [X12,X15,X14,X17] :
      ( s_e(X14,X17,X12,X15)
      | ~ s_e(X12,X15,X14,X17) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_2) ).

fof(aSatz3_14b,axiom,
    ! [X15,X12] : X15 != ext(X12,X15,alpha,gamma),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz3_14b) ).

fof(aA3,axiom,
    ! [X1,X2,X3] :
      ( X1 = X2
      | ~ s_e(X1,X2,X3,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA3) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X27,X12,X15,X14] :
        ( ( s_e(X12,insert(X15,X14,X12,X27),X15,X14)
          | X15 = X14
          | X27 = X12 )
        & ( sameside(insert(X15,X14,X12,X27),X12,X27)
          | X15 = X14
          | X27 = X12 ) ),
    inference(assume_negation,[status(cth)],[aSatz6_11a]) ).

fof(c_0_9,plain,
    ! [X12,X13,X15,X14] :
      ( sameside(X12,X13,X15)
      | ~ s_t(X15,X13,X14)
      | ~ s_t(X12,X13,X14)
      | X14 = X13
      | X15 = X13
      | X12 = X13 ),
    inference(fof_simplification,[status(thm)],[aSatz6_2a]) ).

fof(c_0_10,plain,
    ! [X12,X15,X14] :
      ( s_t(X14,X15,X12)
      | ~ s_t(X12,X15,X14) ),
    inference(fof_simplification,[status(thm)],[aSatz3_2]) ).

fof(c_0_11,negated_conjecture,
    ( ( ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0)
      | ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0) )
    & ( ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0)
      | esk3_0 != esk4_0 )
    & ( ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0)
      | esk1_0 != esk2_0 )
    & ( esk3_0 != esk4_0
      | ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0) )
    & ( esk3_0 != esk4_0
      | esk3_0 != esk4_0 )
    & ( esk3_0 != esk4_0
      | esk1_0 != esk2_0 )
    & ( esk1_0 != esk2_0
      | ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0) )
    & ( esk1_0 != esk2_0
      | esk3_0 != esk4_0 )
    & ( esk1_0 != esk2_0
      | esk1_0 != esk2_0 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).

fof(c_0_12,plain,
    ! [X326,X327,X328,X329] : insert(X326,X327,X328,X329) = ext(ext(X329,X328,alpha,gamma),X328,X326,X327),
    inference(variable_rename,[status(thm)],[d_insert]) ).

fof(c_0_13,plain,
    ! [X292,X293,X294,X295] :
      ( sameside(X292,X293,X294)
      | ~ s_t(X294,X293,X295)
      | ~ s_t(X292,X293,X295)
      | X295 = X293
      | X294 = X293
      | X292 = X293 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).

fof(c_0_14,plain,
    ! [X47,X48,X49,X50] :
      ( s_e(X48,ext(X47,X48,X49,X50),X49,X50)
      & s_t(X47,X48,ext(X47,X48,X49,X50)) ),
    inference(variable_rename,[status(thm)],[aA4]) ).

fof(c_0_15,plain,
    ! [X114,X115,X116] :
      ( s_t(X116,X115,X114)
      | ~ s_t(X114,X115,X116) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).

fof(c_0_16,plain,
    ! [X12,X15,X14,X17] :
      ( s_e(X14,X17,X12,X15)
      | ~ s_e(X12,X15,X14,X17) ),
    inference(fof_simplification,[status(thm)],[aSatz2_2]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0)
    | ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    insert(X1,X2,X3,X4) = ext(ext(X4,X3,alpha,gamma),X3,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    ( ~ s_t(X3,X2,X4)
    | ~ s_t(X1,X2,X4)
    | sameside(X1,X2,X3)
    | X4 = X2
    | X3 = X2
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    s_t(X1,X2,ext(X1,X2,X3,X4)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    ( ~ s_t(X1,X2,X3)
    | s_t(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X15,X12] : X15 != ext(X12,X15,alpha,gamma),
    inference(fof_simplification,[status(thm)],[aSatz3_14b]) ).

fof(c_0_23,plain,
    ! [X68,X69,X70,X71] :
      ( s_e(X70,X71,X68,X69)
      | ~ s_e(X68,X69,X70,X71) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ s_e(esk2_0,ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk3_0,esk4_0)
    | ~ sameside(ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk2_0,esk1_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).

cnf(c_0_25,plain,
    s_e(X1,ext(X2,X1,X3,X4),X3,X4),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_26,plain,
    ( ~ s_t(X5,X2,ext(X1,X2,X3,X4))
    | sameside(X5,X2,X1)
    | X2 = X1
    | X5 = X2
    | ext(X1,X2,X3,X4) = X2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,plain,
    s_t(ext(X1,X2,X3,X4),X2,X1),
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

fof(c_0_28,plain,
    ! [X148,X149] : X148 != ext(X149,X148,alpha,gamma),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).

cnf(c_0_29,negated_conjecture,
    ( esk1_0 != esk2_0
    | esk1_0 != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_30,plain,
    ! [X1,X2,X3] :
      ( X1 = X2
      | ~ s_e(X1,X2,X3,X3) ),
    inference(fof_simplification,[status(thm)],[aA3]) ).

cnf(c_0_31,plain,
    ( ~ s_e(X1,X2,X3,X4)
    | s_e(X3,X4,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_32,negated_conjecture,
    ~ sameside(ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk2_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_33,plain,
    ( sameside(ext(ext(X1,X2,X3,X4),X2,X5,X6),X2,X1)
    | X2 = X1
    | ext(X1,X2,X3,X4) = X2
    | ext(ext(X1,X2,X3,X4),X2,X5,X6) = X2 ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,plain,
    X1 != ext(X2,X1,alpha,gamma),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    esk2_0 != esk1_0,
    inference(cn,[status(thm)],[c_0_29]) ).

fof(c_0_36,plain,
    ! [X44,X45,X46] :
      ( X44 = X45
      | ~ s_e(X44,X45,X46,X46) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).

cnf(c_0_37,plain,
    s_e(X1,X2,X3,ext(X4,X3,X1,X2)),
    inference(spm,[status(thm)],[c_0_31,c_0_25]) ).

cnf(c_0_38,negated_conjecture,
    ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0) = esk2_0,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ( esk3_0 != esk4_0
    | esk3_0 != esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_40,plain,
    ( ~ s_e(X1,X2,X3,X3)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    s_e(esk3_0,esk4_0,esk2_0,esk2_0),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    esk4_0 != esk3_0,
    inference(cn,[status(thm)],[c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO497+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/15.39  % Computer : n008.cluster.edu
% 0.13/15.39  % Model    : x86_64 x86_64
% 0.13/15.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/15.39  % Memory   : 8046.5625MB
% 0.13/15.39  % OS       : Linux 6.8.0-71-generic
% 0.13/15.39  % CPULimit : 300
% 0.13/15.39  % WCLimit  : 300
% 0.13/15.39  % DateTime : Sun Sep 20 16:54:41 UTC 2026
% 0.13/15.40  % CPUTime  : 
% 0.13/15.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/15.44  Running first-order theorem proving
% 0.16/15.44  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
% 15.34/17.48  % Version: 3.5.1
% 15.34/17.48  % Preprocessing class: FSLSSMSSSSSNFFN.
% 15.34/17.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.34/17.48  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.34/17.48  % Starting new_bool_3 with 300s (1) cores
% 15.34/17.48  % Starting new_bool_1 with 300s (1) cores
% 15.34/17.48  % Starting sh5l with 300s (1) cores
% 15.34/17.48  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3241990 completed with status 0
% 15.34/17.48  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 15.34/17.48  % Preprocessing class: FSLSSMSSSSSNFFN.
% 15.34/17.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.34/17.48  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.34/17.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.34/17.48  % No SInE strategy applied
% 15.34/17.48  % Search class: FGHSM-FFLF33-MFFFFFNN
% 15.34/17.48  % partial match(2): FGHSM-FFLM31-MFFFFFNN
% 15.34/17.48  % Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 15.34/17.48  % Starting SubtermCWHack with 136s (1) cores
% 15.34/17.48  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 15.34/17.48  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 15.34/17.48  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 15.34/17.48  % Starting G-E--_200_B07_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 15.34/17.48  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3241998 completed with status 0
% 15.34/17.48  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 15.34/17.48  % Preprocessing class: FSLSSMSSSSSNFFN.
% 15.34/17.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.34/17.48  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.34/17.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.34/17.48  % No SInE strategy applied
% 15.34/17.48  % Search class: FGHSM-FFLF33-MFFFFFNN
% 15.34/17.48  % partial match(2): FGHSM-FFLM31-MFFFFFNN
% 15.34/17.48  % Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 15.34/17.48  % Starting SubtermCWHack with 136s (1) cores
% 15.34/17.48  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 15.34/17.48  % Preprocessing time       : 0.003 s
% 15.34/17.48  % Presaturation interreduction done
% 15.34/17.48  
% 15.34/17.48  % Proof found!
% 15.34/17.48  % SZS status Theorem
% 15.34/17.48  % SZS output start CNFRefutation
% See solution above
% 15.34/17.48  % Parsed axioms                        : 85
% 15.34/17.48  % Removed by relevancy pruning/SinE    : 0
% 15.34/17.48  % Initial clauses                      : 134
% 15.34/17.48  % Removed in clause preprocessing      : 1
% 15.34/17.48  % Initial clauses in saturation        : 133
% 15.34/17.48  % Processed clauses                    : 8551
% 15.34/17.48  % ...of these trivial                  : 1336
% 15.34/17.48  % ...subsumed                          : 3905
% 15.34/17.48  % ...remaining for further processing  : 3310
% 15.34/17.48  % Other redundant clauses eliminated   : 4
% 15.34/17.48  % Clauses deleted for lack of memory   : 0
% 15.34/17.48  % Backward-subsumed                    : 326
% 15.34/17.48  % Backward-rewritten                   : 434
% 15.34/17.48  % Generated clauses                    : 102097
% 15.34/17.48  % ...of the previous two non-redundant : 83697
% 15.34/17.48  % ...aggressively subsumed             : 0
% 15.34/17.48  % Contextual simplify-reflections      : 4
% 15.34/17.48  % Paramodulations                      : 102079
% 15.34/17.48  % Factorizations                       : 14
% 15.34/17.48  % NegExts                              : 0
% 15.34/17.48  % Equation resolutions                 : 4
% 15.34/17.48  % Disequality decompositions           : 0
% 15.34/17.48  % Total rewrite steps                  : 23225
% 15.34/17.48  % ...of those cached                   : 19370
% 15.34/17.48  % Propositional unsat checks           : 0
% 15.34/17.48  %    Propositional check models        : 0
% 15.34/17.48  %    Propositional check unsatisfiable : 0
% 15.34/17.48  %    Propositional clauses             : 0
% 15.34/17.48  %    Propositional clauses after purity: 0
% 15.34/17.48  %    Propositional unsat core size     : 0
% 15.34/17.48  %    Propositional preprocessing time  : 0.000
% 15.34/17.48  %    Propositional encoding time       : 0.000
% 15.34/17.48  %    Propositional solver time         : 0.000
% 15.34/17.48  %    Success case prop preproc time    : 0.000
% 15.34/17.48  %    Success case prop encoding time   : 0.000
% 15.34/17.48  %    Success case prop solver time     : 0.000
% 15.34/17.48  % Current number of processed clauses  : 2424
% 15.34/17.48  %    Positive orientable unit clauses  : 860
% 15.34/17.48  %    Positive unorientable unit clauses: 0
% 15.34/17.48  %    Negative unit clauses             : 324
% 15.34/17.48  %    Non-unit-clauses                  : 1240
% 15.34/17.48  % Current number of unprocessed clauses: 73991
% 15.34/17.48  % ...number of literals in the above   : 193418
% 15.34/17.48  % Current number of archived formulas  : 0
% 15.34/17.48  % Current number of archived clauses   : 883
% 15.34/17.48  % Clause-clause subsumption calls (NU) : 229598
% 15.34/17.48  % Rec. Clause-clause subsumption calls : 141491
% 15.34/17.48  % Non-unit clause-clause subsumptions  : 2926
% 15.34/17.48  % Unit Clause-clause subsumption calls : 93812
% 15.34/17.48  % Rewrite failures with RHS unbound    : 0
% 15.34/17.48  % BW rewrite match attempts            : 16410
% 15.34/17.48  % BW rewrite match successes           : 222
% 15.34/17.48  % Condensation attempts                : 0
% 15.34/17.48  % Condensation successes               : 0
% 15.34/17.48  % Termbank termtop insertions          : 1935213
% 15.34/17.48  % Search garbage collected termcells   : 910
% 15.34/17.48  
% 15.34/17.48  % -------------------------------------------------
% 15.34/17.48  % User time                : 1.905 s
% 15.34/17.48  % System time              : 0.069 s
% 15.34/17.48  % Total time               : 1.974 s
% 15.34/17.48  % Maximum resident set size: 4296 pages
% 15.34/17.48  
% 15.34/17.48  % -------------------------------------------------
% 15.34/17.48  % User time                : 9.405 s
% 15.34/17.48  % System time              : 0.369 s
% 15.34/17.48  % Total time               : 9.774 s
% 15.34/17.48  % Maximum resident set size: 4864 pages
% 15.34/17.48  % E exiting
%------------------------------------------------------------------------------