TSTP Solution File: ITP209_3 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : ITP209_3 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 : Sat May  4 08:09:36 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   20 (  11 unt;   9 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    3 (   3 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn  15   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    fun_a_fun_a_a: $tType ).

tff(decl_sort2,type,
    a: $tType ).

tff(decl_sort3,type,
    fun_a_a: $tType ).

tff(decl_23,type,
    aa_a_fun_a_a: ( fun_a_fun_a_a * a ) > fun_a_a ).

tff(decl_24,type,
    aa_a_a: ( fun_a_a * a ) > a ).

tff(decl_25,type,
    a2: a ).

tff(decl_26,type,
    b: a ).

tff(decl_27,type,
    c: a ).

tff(decl_28,type,
    f: fun_a_fun_a_a ).

tff(conj_0,conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) = aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    file('/export/starexec/sandbox2/tmp/tmp.ABh609klrZ/E---3.1_23980.p',conj_0) ).

tff(fact_3_right__assoc,axiom,
    ! [X1: a,X2: a,X3: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,X1),X2)),X3) = aa_a_a(aa_a_fun_a_a(f,X1),aa_a_a(aa_a_fun_a_a(f,X2),X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.ABh609klrZ/E---3.1_23980.p',fact_3_right__assoc) ).

tff(fact_1_commute,axiom,
    ! [X1: a,X2: a] : ( aa_a_a(aa_a_fun_a_a(f,X1),X2) = aa_a_a(aa_a_fun_a_a(f,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.ABh609klrZ/E---3.1_23980.p',fact_1_commute) ).

tff(c_0_3,negated_conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

tff(c_0_4,negated_conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

tff(c_0_5,plain,
    ! [X49: a,X50: a,X51: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,X49),X50)),X51) = aa_a_a(aa_a_fun_a_a(f,X49),aa_a_a(aa_a_fun_a_a(f,X50),X51)) ),
    inference(variable_rename,[status(thm)],[fact_3_right__assoc]) ).

tff(c_0_6,plain,
    ! [X44: a,X45: a] : ( aa_a_a(aa_a_fun_a_a(f,X44),X45) = aa_a_a(aa_a_fun_a_a(f,X45),X44) ),
    inference(variable_rename,[status(thm)],[fact_1_commute]) ).

tcf(c_0_7,negated_conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

tcf(c_0_8,plain,
    ! [X1: a,X2: a,X3: a] : aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,X1),X2)),X3) = aa_a_a(aa_a_fun_a_a(f,X1),aa_a_a(aa_a_fun_a_a(f,X2),X3)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_9,plain,
    ! [X2: a,X1: a] : aa_a_a(aa_a_fun_a_a(f,X1),X2) = aa_a_a(aa_a_fun_a_a(f,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : ITP209_3 : TPTP v8.1.2. Released v8.0.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 12:47:46 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ABh609klrZ/E---3.1_23980.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_1 with pid 24059 completed with status 0
% 0.20/0.50  # Result found by new_bool_1
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUSS-FFMF21-MFFFFFNN
% 0.20/0.50  # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.20/0.50  # G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 24065 completed with status 0
% 0.20/0.50  # Result found by G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUSS-FFMF21-MFFFFFNN
% 0.20/0.50  # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 21
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 10
% 0.20/0.50  # Initial clauses                      : 13
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 13
% 0.20/0.50  # Processed clauses                    : 6
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 1
% 0.20/0.50  # ...remaining for further processing  : 4
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 0
% 0.20/0.50  # ...of the previous two non-redundant : 0
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 0
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 3
% 0.20/0.50  # ...of those cached                   : 0
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 4
% 0.20/0.50  #    Positive orientable unit clauses  : 2
% 0.20/0.50  #    Positive unorientable unit clauses: 1
% 0.20/0.50  #    Negative unit clauses             : 0
% 0.20/0.50  #    Non-unit-clauses                  : 1
% 0.20/0.50  # Current number of unprocessed clauses: 7
% 0.20/0.50  # ...number of literals in the above   : 15
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 0
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 1
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 1
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 1
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 1218
% 0.20/0.50  # Search garbage collected termcells   : 202
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.007 s
% 0.20/0.50  # Maximum resident set size: 1864 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.007 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.010 s
% 0.20/0.50  # Maximum resident set size: 1724 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------