TSTP Solution File: COL050-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n008.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 07:28:47 EDT 2024

% Result   : Unsatisfiable 0.20s 0.49s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   5 RR)
%            Number of literals    :   10 (   9 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_all_fond_of_another,negated_conjecture,
    response(a,X1) != X1,
    file('/export/starexec/sandbox2/tmp/tmp.ar2tFJEKpP/E---3.1_15193.p',prove_all_fond_of_another) ).

cnf(mocking_bird_exists,axiom,
    response(mocking_bird,X1) = response(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.ar2tFJEKpP/E---3.1_15193.p',mocking_bird_exists) ).

cnf(composer_exists,hypothesis,
    response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.ar2tFJEKpP/E---3.1_15193.p',composer_exists) ).

cnf(c_0_3,negated_conjecture,
    response(a,X1) != X1,
    inference(fof_simplification,[status(thm)],[prove_all_fond_of_another]) ).

cnf(c_0_4,axiom,
    response(mocking_bird,X1) = response(X1,X1),
    mocking_bird_exists ).

cnf(c_0_5,hypothesis,
    response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
    composer_exists ).

cnf(c_0_6,negated_conjecture,
    response(a,X1) != X1,
    c_0_3 ).

cnf(c_0_7,hypothesis,
    response(X1,response(X2,compose(X1,X2))) = response(mocking_bird,compose(X1,X2)),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    response(mocking_bird,compose(a,X1)) != response(X1,compose(a,X1)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(er,[status(thm)],[c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : COL050-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 11:37:42 EDT 2024
% 0.14/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.ar2tFJEKpP/E---3.1_15193.p
% 0.20/0.49  # Version: 3.1.0
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49  # Starting sh5l with 300s (1) cores
% 0.20/0.49  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15345 completed with status 0
% 0.20/0.49  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49  # Starting sh5l with 136s (1) cores
% 0.20/0.49  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 15350 completed with status 0
% 0.20/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 811s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.001 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49  
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Unsatisfiable
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 3
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.49  # Initial clauses                      : 3
% 0.20/0.49  # Removed in clause preprocessing      : 0
% 0.20/0.49  # Initial clauses in saturation        : 3
% 0.20/0.49  # Processed clauses                    : 9
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 9
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 0
% 0.20/0.49  # Backward-rewritten                   : 0
% 0.20/0.49  # Generated clauses                    : 7
% 0.20/0.49  # ...of the previous two non-redundant : 5
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 0
% 0.20/0.49  # Paramodulations                      : 6
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 1
% 0.20/0.49  # Disequality decompositions           : 0
% 0.20/0.49  # Total rewrite steps                  : 0
% 0.20/0.49  # ...of those cached                   : 0
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 6
% 0.20/0.49  #    Positive orientable unit clauses  : 2
% 0.20/0.49  #    Positive unorientable unit clauses: 1
% 0.20/0.49  #    Negative unit clauses             : 3
% 0.20/0.49  #    Non-unit-clauses                  : 0
% 0.20/0.49  # Current number of unprocessed clauses: 2
% 0.20/0.49  # ...number of literals in the above   : 2
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 3
% 0.20/0.49  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.49  # Unit Clause-clause subsumption calls : 0
% 0.20/0.49  # Rewrite failures with RHS unbound    : 0
% 0.20/0.49  # BW rewrite match attempts            : 2
% 0.20/0.49  # BW rewrite match successes           : 0
% 0.20/0.49  # Condensation attempts                : 0
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 153
% 0.20/0.49  # Search garbage collected termcells   : 2
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.002 s
% 0.20/0.49  # System time              : 0.002 s
% 0.20/0.49  # Total time               : 0.004 s
% 0.20/0.49  # Maximum resident set size: 1540 pages
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.010 s
% 0.20/0.49  # System time              : 0.007 s
% 0.20/0.49  # Total time               : 0.016 s
% 0.20/0.49  # Maximum resident set size: 1680 pages
% 0.20/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------