↑ Up

E---3.5.1.UNS-CRf.s

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

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

% Result   : Unsatisfiable 0.14s 0.42s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;  17 RR)
%            Number of literals    :   36 (  35 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(lark_lemma1,axiom,
    response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_lemma1) ).

cnf(l2_definition,axiom,
    response(lark,lark) = l2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_definition) ).

cnf(lark_exists,axiom,
    response(response(lark,X1),X2) = response(X1,response(X2,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_exists) ).

cnf(l3_definition,axiom,
    response(l2,lark) = l3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_definition) ).

cnf(prove_l3_not_egocentric,negated_conjecture,
    response(l3,l3) = l3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l3_not_egocentric) ).

cnf(lark_lemma2,axiom,
    response(response(response(response(lark,lark),lark),X1),X2) = response(response(response(X1,X1),response(X1,X1)),response(x2,x2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_lemma2) ).

cnf(kestrel_exists,axiom,
    response(response(kestrel,X1),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kestrel_exists) ).

cnf(lark_not_egocentric,axiom,
    response(l2,l2) != l2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_not_egocentric) ).

cnf(c_0_8,axiom,
    response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2)),
    lark_lemma1 ).

cnf(c_0_9,axiom,
    response(lark,lark) = l2,
    l2_definition ).

cnf(c_0_10,axiom,
    response(response(lark,X1),X2) = response(X1,response(X2,X2)),
    lark_exists ).

cnf(c_0_11,plain,
    response(response(X1,X1),response(X2,X2)) = response(response(l2,X1),X2),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    response(l2,lark) = l3,
    l3_definition ).

cnf(c_0_13,plain,
    response(lark,response(X1,X1)) = response(l2,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    response(l3,l3) = l3,
    prove_l3_not_egocentric ).

cnf(c_0_15,plain,
    response(l2,response(X1,X1)) = response(l3,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    response(l2,l3) = response(lark,l3),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    response(response(response(response(lark,lark),lark),X1),X2) = response(response(response(X1,X1),response(X1,X1)),response(x2,x2)),
    lark_lemma2 ).

cnf(c_0_18,negated_conjecture,
    response(lark,l3) = l3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]),c_0_14]) ).

cnf(c_0_19,plain,
    response(response(l3,X1),X2) = response(response(response(l2,X1),X1),response(x2,x2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_9]),c_0_12]),c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    response(l3,response(X1,X1)) = response(l3,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_18]) ).

cnf(c_0_21,plain,
    response(l3,x2) = response(l3,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_16]),c_0_18]),c_0_14]),c_0_20]),c_0_16]),c_0_18]) ).

cnf(c_0_22,plain,
    response(l3,X1) = response(l3,X2),
    inference(spm,[status(thm)],[c_0_21,c_0_21]) ).

cnf(c_0_23,negated_conjecture,
    response(l3,X1) = l3,
    inference(spm,[status(thm)],[c_0_14,c_0_22]) ).

cnf(c_0_24,axiom,
    response(response(kestrel,X1),X2) = X1,
    kestrel_exists ).

cnf(c_0_25,plain,
    response(l2,response(X1,X1)) = l3,
    inference(rw,[status(thm)],[c_0_15,c_0_23]) ).

cnf(c_0_26,plain,
    response(response(l2,kestrel),X1) = kestrel,
    inference(spm,[status(thm)],[c_0_24,c_0_11]) ).

cnf(c_0_27,plain,
    response(l2,l2) != l2,
    inference(fof_simplification,[status(thm)],[lark_not_egocentric]) ).

cnf(c_0_28,plain,
    response(l3,lark) = response(l2,l2),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

cnf(c_0_29,plain,
    response(l2,kestrel) = l3,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    response(l2,l2) != l2,
    c_0_27 ).

cnf(c_0_31,plain,
    response(l2,l2) = l3,
    inference(rw,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_32,plain,
    kestrel = l3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_29]),c_0_23]) ).

cnf(c_0_33,plain,
    l3 != l2,
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,plain,
    l3 = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_23]),c_0_23]) ).

cnf(c_0_35,plain,
    $false,
    inference(sr,[status(thm)],[c_0_33,c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL059-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n026.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 14:10:07 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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/0.42  % Version: 3.5.1
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42  % Starting sh5l with 300s (1) cores
% 0.14/0.42  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2473103 completed with status 0
% 0.14/0.42  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42  % No SInE strategy applied
% 0.14/0.42  % Search class: FUUPM-FFSS22-MFFFFFNN
% 0.14/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 0.14/0.42  % Starting new_bool_3 with 226s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 226s (1) cores
% 0.14/0.42  % new_bool_1 with pid 2473114 completed with status 0
% 0.14/0.42  % Result found by new_bool_1
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42  % No SInE strategy applied
% 0.14/0.42  % Search class: FUUPM-FFSS22-MFFFFFNN
% 0.14/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 0.14/0.42  % Starting new_bool_3 with 226s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 226s (1) cores
% 0.14/0.42  % Preprocessing time       : 0.001 s
% 0.14/0.42  % Presaturation interreduction done
% 0.14/0.42  
% 0.14/0.42  % Proof found!
% 0.14/0.42  % SZS status Unsatisfiable
% 0.14/0.42  % SZS output start CNFRefutation
% See solution above
% 0.14/0.42  % Parsed axioms                        : 8
% 0.14/0.42  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.42  % Initial clauses                      : 8
% 0.14/0.42  % Removed in clause preprocessing      : 0
% 0.14/0.42  % Initial clauses in saturation        : 8
% 0.14/0.42  % Processed clauses                    : 41
% 0.14/0.42  % ...of these trivial                  : 3
% 0.14/0.42  % ...subsumed                          : 0
% 0.14/0.42  % ...remaining for further processing  : 38
% 0.14/0.42  % Other redundant clauses eliminated   : 0
% 0.14/0.42  % Clauses deleted for lack of memory   : 0
% 0.14/0.42  % Backward-subsumed                    : 1
% 0.14/0.42  % Backward-rewritten                   : 27
% 0.14/0.42  % Generated clauses                    : 117
% 0.14/0.42  % ...of the previous two non-redundant : 105
% 0.14/0.42  % ...aggressively subsumed             : 0
% 0.14/0.42  % Contextual simplify-reflections      : 0
% 0.14/0.42  % Paramodulations                      : 116
% 0.14/0.42  % Factorizations                       : 0
% 0.14/0.42  % NegExts                              : 0
% 0.14/0.42  % Equation resolutions                 : 0
% 0.14/0.42  % Disequality decompositions           : 0
% 0.14/0.42  % Total rewrite steps                  : 159
% 0.14/0.42  % ...of those cached                   : 109
% 0.14/0.42  % Propositional unsat checks           : 0
% 0.14/0.42  %    Propositional check models        : 0
% 0.14/0.42  %    Propositional check unsatisfiable : 0
% 0.14/0.42  %    Propositional clauses             : 0
% 0.14/0.42  %    Propositional clauses after purity: 0
% 0.14/0.42  %    Propositional unsat core size     : 0
% 0.14/0.42  %    Propositional preprocessing time  : 0.000
% 0.14/0.42  %    Propositional encoding time       : 0.000
% 0.14/0.42  %    Propositional solver time         : 0.000
% 0.14/0.42  %    Success case prop preproc time    : 0.000
% 0.14/0.42  %    Success case prop encoding time   : 0.000
% 0.14/0.42  %    Success case prop solver time     : 0.000
% 0.14/0.42  % Current number of processed clauses  : 1
% 0.14/0.42  %    Positive orientable unit clauses  : 0
% 0.14/0.42  %    Positive unorientable unit clauses: 1
% 0.14/0.42  %    Negative unit clauses             : 0
% 0.14/0.42  %    Non-unit-clauses                  : 0
% 0.14/0.42  % Current number of unprocessed clauses: 58
% 0.14/0.42  % ...number of literals in the above   : 58
% 0.14/0.42  % Current number of archived formulas  : 0
% 0.14/0.42  % Current number of archived clauses   : 37
% 0.14/0.42  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.42  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.42  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.42  % Unit Clause-clause subsumption calls : 1
% 0.14/0.42  % Rewrite failures with RHS unbound    : 23
% 0.14/0.42  % BW rewrite match attempts            : 54
% 0.14/0.42  % BW rewrite match successes           : 54
% 0.14/0.42  % Condensation attempts                : 0
% 0.14/0.42  % Condensation successes               : 0
% 0.14/0.42  % Termbank termtop insertions          : 1325
% 0.14/0.42  % Search garbage collected termcells   : 2
% 0.14/0.42  
% 0.14/0.42  % -------------------------------------------------
% 0.14/0.42  % User time                : 0.003 s
% 0.14/0.42  % System time              : 0.002 s
% 0.14/0.42  % Total time               : 0.005 s
% 0.14/0.42  % Maximum resident set size: 3632 pages
% 0.14/0.42  
% 0.14/0.42  % -------------------------------------------------
% 0.14/0.42  % User time                : 0.016 s
% 0.14/0.42  % System time              : 0.010 s
% 0.14/0.42  % Total time               : 0.026 s
% 0.14/0.42  % Maximum resident set size: 4608 pages
% 0.14/0.42  % E exiting
%------------------------------------------------------------------------------