↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n003.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:05:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

cnf(lhs2,hypothesis,
    meet(xx,yy) = meet(xx,zz),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs2) ).

cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

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

cnf(lhs1,hypothesis,
    join(xx,yy) = join(xx,zz),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs1) ).

cnf(rhs,negated_conjecture,
    yy != zz,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rhs) ).

cnf(c_0_9,axiom,
    join(X1,meet(X1,X2)) = X1,
    absorption2 ).

cnf(c_0_10,axiom,
    meet(X1,X2) = meet(X2,X1),
    commutativity_of_meet ).

cnf(c_0_11,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption1 ).

cnf(c_0_12,axiom,
    join(X1,X2) = join(X2,X1),
    commutativity_of_join ).

cnf(c_0_13,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    meet(xx,yy) = meet(xx,zz),
    lhs2 ).

cnf(c_0_15,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    join(yy,meet(xx,zz)) = yy,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    associativity_of_meet ).

cnf(c_0_18,hypothesis,
    meet(xx,meet(zz,yy)) = meet(xx,zz),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_19,hypothesis,
    meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
    dist_meet ).

cnf(c_0_20,hypothesis,
    join(meet(xx,zz),meet(zz,yy)) = meet(zz,yy),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_12]) ).

cnf(c_0_21,hypothesis,
    join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
    inference(spm,[status(thm)],[c_0_19,c_0_10]) ).

cnf(c_0_22,hypothesis,
    join(xx,yy) = join(xx,zz),
    lhs1 ).

cnf(c_0_23,hypothesis,
    join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(X2,X3)),
    inference(spm,[status(thm)],[c_0_19,c_0_10]) ).

cnf(c_0_24,hypothesis,
    meet(zz,yy) = zz,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    yy != zz,
    inference(fof_simplification,[status(thm)],[rhs]) ).

cnf(c_0_26,hypothesis,
    meet(yy,join(xx,zz)) = yy,
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_27,hypothesis,
    meet(yy,join(X1,zz)) = join(zz,meet(yy,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12]) ).

cnf(c_0_28,negated_conjecture,
    yy != zz,
    c_0_25 ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_10]),c_0_14]),c_0_13]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT040-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n003.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 20 23:09:30 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42  Running first-order theorem proving
% 0.14/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.14/0.47  % Version: 3.5.1
% 0.14/0.47  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47  % Starting sh5l with 300s (1) cores
% 0.14/0.47  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2817611 completed with status 0
% 0.14/0.47  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.47  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47  % No SInE strategy applied
% 0.14/0.47  % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.14/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.47  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2817618 completed with status 0
% 0.14/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.47  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47  % No SInE strategy applied
% 0.14/0.47  % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.14/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47  % Preprocessing time       : 0.001 s
% 0.14/0.47  % Presaturation interreduction done
% 0.14/0.47  
% 0.14/0.47  % Proof found!
% 0.14/0.47  % SZS status Unsatisfiable
% 0.14/0.47  % SZS output start CNFRefutation
% See solution above
% 0.14/0.47  % Parsed axioms                        : 13
% 0.14/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.47  % Initial clauses                      : 13
% 0.14/0.47  % Removed in clause preprocessing      : 0
% 0.14/0.47  % Initial clauses in saturation        : 13
% 0.14/0.47  % Processed clauses                    : 428
% 0.14/0.47  % ...of these trivial                  : 190
% 0.14/0.47  % ...subsumed                          : 106
% 0.14/0.47  % ...remaining for further processing  : 132
% 0.14/0.47  % Other redundant clauses eliminated   : 0
% 0.14/0.47  % Clauses deleted for lack of memory   : 0
% 0.14/0.47  % Backward-subsumed                    : 0
% 0.14/0.47  % Backward-rewritten                   : 29
% 0.14/0.47  % Generated clauses                    : 5505
% 0.14/0.47  % ...of the previous two non-redundant : 3126
% 0.14/0.47  % ...aggressively subsumed             : 0
% 0.14/0.47  % Contextual simplify-reflections      : 0
% 0.14/0.47  % Paramodulations                      : 5505
% 0.14/0.47  % Factorizations                       : 0
% 0.14/0.47  % NegExts                              : 0
% 0.14/0.47  % Equation resolutions                 : 0
% 0.14/0.47  % Disequality decompositions           : 0
% 0.14/0.47  % Total rewrite steps                  : 7098
% 0.14/0.47  % ...of those cached                   : 4942
% 0.14/0.47  % Propositional unsat checks           : 0
% 0.14/0.47  %    Propositional check models        : 0
% 0.14/0.47  %    Propositional check unsatisfiable : 0
% 0.14/0.47  %    Propositional clauses             : 0
% 0.14/0.47  %    Propositional clauses after purity: 0
% 0.14/0.47  %    Propositional unsat core size     : 0
% 0.14/0.47  %    Propositional preprocessing time  : 0.000
% 0.14/0.47  %    Propositional encoding time       : 0.000
% 0.14/0.47  %    Propositional solver time         : 0.000
% 0.14/0.47  %    Success case prop preproc time    : 0.000
% 0.14/0.47  %    Success case prop encoding time   : 0.000
% 0.14/0.47  %    Success case prop solver time     : 0.000
% 0.14/0.47  % Current number of processed clauses  : 90
% 0.14/0.47  %    Positive orientable unit clauses  : 83
% 0.14/0.47  %    Positive unorientable unit clauses: 6
% 0.14/0.47  %    Negative unit clauses             : 1
% 0.14/0.47  %    Non-unit-clauses                  : 0
% 0.14/0.47  % Current number of unprocessed clauses: 2718
% 0.14/0.47  % ...number of literals in the above   : 2718
% 0.14/0.47  % Current number of archived formulas  : 0
% 0.14/0.47  % Current number of archived clauses   : 42
% 0.14/0.47  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.47  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.47  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.47  % Unit Clause-clause subsumption calls : 19
% 0.14/0.47  % Rewrite failures with RHS unbound    : 0
% 0.14/0.47  % BW rewrite match attempts            : 366
% 0.14/0.47  % BW rewrite match successes           : 196
% 0.14/0.47  % Condensation attempts                : 0
% 0.14/0.47  % Condensation successes               : 0
% 0.14/0.47  % Termbank termtop insertions          : 55331
% 0.14/0.47  % Search garbage collected termcells   : 2
% 0.14/0.47  
% 0.14/0.47  % -------------------------------------------------
% 0.14/0.47  % User time                : 0.030 s
% 0.14/0.47  % System time              : 0.004 s
% 0.14/0.47  % Total time               : 0.033 s
% 0.14/0.47  % Maximum resident set size: 3380 pages
% 0.14/0.47  
% 0.14/0.47  % -------------------------------------------------
% 0.14/0.47  % User time                : 0.138 s
% 0.14/0.47  % System time              : 0.016 s
% 0.14/0.47  % Total time               : 0.153 s
% 0.14/0.47  % Maximum resident set size: 4608 pages
% 0.14/0.47  % E exiting
%------------------------------------------------------------------------------