↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n005.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 01:04:02 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.43s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   9 unt;   0 nHn;   4 RR)
%            Number of literals    :    9 (   8 equ;   3 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 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_absorbtion,negated_conjecture,
    meet(a,join(a,b)) != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_absorbtion) ).

cnf(mckenzie2,axiom,
    meet(X1,join(X2,join(X1,X3))) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie2) ).

cnf(mckenzie3,axiom,
    join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie3) ).

cnf(c_0_3,negated_conjecture,
    meet(a,join(a,b)) != a,
    inference(fof_simplification,[status(thm)],[prove_absorbtion]) ).

cnf(c_0_4,axiom,
    meet(X1,join(X2,join(X1,X3))) = X1,
    mckenzie2 ).

cnf(c_0_5,axiom,
    join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
    mckenzie3 ).

cnf(c_0_6,negated_conjecture,
    meet(a,join(a,b)) != a,
    c_0_3 ).

cnf(c_0_7,plain,
    meet(X1,join(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT014-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n005.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 23:06:48 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.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.10/0.43  % Version: 3.5.1
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43  % Starting sh5l with 300s (1) cores
% 0.10/0.43  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1956254 completed with status 0
% 0.10/0.43  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43  % No SInE strategy applied
% 0.10/0.43  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.10/0.43  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.43  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.10/0.43  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.43  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.43  % U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1956261 completed with status 0
% 0.10/0.43  % Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43  % No SInE strategy applied
% 0.10/0.43  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.10/0.43  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.43  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.10/0.43  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.001 s
% 0.10/0.43  % Presaturation interreduction done
% 0.10/0.43  
% 0.10/0.43  % Proof found!
% 0.10/0.43  % SZS status Unsatisfiable
% 0.10/0.43  % SZS output start CNFRefutation
% See solution above
% 0.10/0.43  % Parsed axioms                        : 5
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.43  % Initial clauses                      : 5
% 0.10/0.43  % Removed in clause preprocessing      : 0
% 0.10/0.43  % Initial clauses in saturation        : 5
% 0.10/0.43  % Processed clauses                    : 18
% 0.10/0.43  % ...of these trivial                  : 1
% 0.10/0.43  % ...subsumed                          : 0
% 0.10/0.43  % ...remaining for further processing  : 17
% 0.10/0.43  % Other redundant clauses eliminated   : 0
% 0.10/0.43  % Clauses deleted for lack of memory   : 0
% 0.10/0.43  % Backward-subsumed                    : 0
% 0.10/0.43  % Backward-rewritten                   : 1
% 0.10/0.43  % Generated clauses                    : 71
% 0.10/0.43  % ...of the previous two non-redundant : 48
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 0
% 0.10/0.43  % Paramodulations                      : 71
% 0.10/0.43  % Factorizations                       : 0
% 0.10/0.43  % NegExts                              : 0
% 0.10/0.43  % Equation resolutions                 : 0
% 0.10/0.43  % Disequality decompositions           : 0
% 0.10/0.43  % Total rewrite steps                  : 17
% 0.10/0.43  % ...of those cached                   : 9
% 0.10/0.43  % Propositional unsat checks           : 0
% 0.10/0.43  %    Propositional check models        : 0
% 0.10/0.43  %    Propositional check unsatisfiable : 0
% 0.10/0.43  %    Propositional clauses             : 0
% 0.10/0.43  %    Propositional clauses after purity: 0
% 0.10/0.43  %    Propositional unsat core size     : 0
% 0.10/0.43  %    Propositional preprocessing time  : 0.000
% 0.10/0.43  %    Propositional encoding time       : 0.000
% 0.10/0.43  %    Propositional solver time         : 0.000
% 0.10/0.43  %    Success case prop preproc time    : 0.000
% 0.10/0.43  %    Success case prop encoding time   : 0.000
% 0.10/0.43  %    Success case prop solver time     : 0.000
% 0.10/0.43  % Current number of processed clauses  : 11
% 0.10/0.43  %    Positive orientable unit clauses  : 11
% 0.10/0.43  %    Positive unorientable unit clauses: 0
% 0.10/0.43  %    Negative unit clauses             : 0
% 0.10/0.43  %    Non-unit-clauses                  : 0
% 0.10/0.43  % Current number of unprocessed clauses: 40
% 0.10/0.43  % ...number of literals in the above   : 40
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 6
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 0
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.43  % Unit Clause-clause subsumption calls : 0
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 26
% 0.10/0.43  % BW rewrite match successes           : 1
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 371
% 0.10/0.43  % Search garbage collected termcells   : 2
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.002 s
% 0.10/0.43  % System time              : 0.002 s
% 0.10/0.43  % Total time               : 0.004 s
% 0.10/0.43  % Maximum resident set size: 3632 pages
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.010 s
% 0.10/0.43  % System time              : 0.010 s
% 0.10/0.43  % Total time               : 0.020 s
% 0.10/0.43  % Maximum resident set size: 4864 pages
% 0.10/0.43  % E exiting
%------------------------------------------------------------------------------