↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT038-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 : n012.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:06 PM UTC 2026

% Result   : Unsatisfiable 0.93s 0.65s
% Output   : CNFRefutation 0.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  37 unt;   0 nHn;  16 RR)
%            Number of literals    :   37 (  36 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   47 (   7 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(lhs2,hypothesis,
    meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs2) ).

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(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,
    f(join(aa,bb),dd) = f(join(cc,bb),dd),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs1) ).

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

cnf(rhs,negated_conjecture,
    f(aa,dd) != f(cc,dd),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rhs) ).

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

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

cnf(c_0_12,hypothesis,
    meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
    lhs2 ).

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

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

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

cnf(c_0_16,hypothesis,
    meet(f(bb,dd),f(aa,dd)) = meet(f(bb,dd),f(cc,dd)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).

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

cnf(c_0_18,hypothesis,
    join(f(aa,dd),meet(f(bb,dd),f(cc,dd))) = f(aa,dd),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,hypothesis,
    meet(f(bb,dd),meet(f(cc,dd),f(aa,dd))) = meet(f(bb,dd),f(cc,dd)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

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

cnf(c_0_22,hypothesis,
    f(join(aa,bb),dd) = f(join(cc,bb),dd),
    lhs1 ).

cnf(c_0_23,hypothesis,
    join(meet(f(bb,dd),f(cc,dd)),meet(f(cc,dd),f(aa,dd))) = meet(f(cc,dd),f(aa,dd)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_14]) ).

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

cnf(c_0_25,axiom,
    f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
    f_on_left_join ).

cnf(c_0_26,hypothesis,
    f(join(bb,aa),dd) = f(join(bb,cc),dd),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).

cnf(c_0_27,hypothesis,
    meet(f(cc,dd),f(join(bb,cc),dd)) = meet(f(cc,dd),f(aa,dd)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).

cnf(c_0_28,plain,
    meet(f(X1,X2),f(join(X3,X1),X2)) = f(X1,X2),
    inference(spm,[status(thm)],[c_0_17,c_0_25]) ).

cnf(c_0_29,hypothesis,
    meet(f(cc,dd),f(aa,dd)) = f(cc,dd),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,hypothesis,
    meet(f(aa,dd),join(f(cc,dd),X1)) = join(f(cc,dd),meet(f(aa,dd),X1)),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_31,hypothesis,
    join(f(cc,dd),meet(f(aa,dd),f(X1,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
    inference(spm,[status(thm)],[c_0_30,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    f(aa,dd) != f(cc,dd),
    inference(fof_simplification,[status(thm)],[rhs]) ).

cnf(c_0_33,hypothesis,
    join(f(cc,dd),meet(f(X1,dd),f(aa,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
    inference(spm,[status(thm)],[c_0_31,c_0_11]) ).

cnf(c_0_34,hypothesis,
    meet(f(aa,dd),f(join(bb,cc),dd)) = f(aa,dd),
    inference(spm,[status(thm)],[c_0_28,c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    f(aa,dd) != f(cc,dd),
    c_0_32 ).

cnf(c_0_36,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_16]),c_0_15]),c_0_14]),c_0_34]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT038-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n012.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 23:07:37 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39  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.93/0.65  % Version: 3.5.1
% 0.93/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.93/0.65  % Starting new_bool_1 with 300s (1) cores
% 0.93/0.65  % Starting sh5l with 300s (1) cores
% 0.93/0.65  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1050533 completed with status 0
% 0.93/0.65  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.93/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.65  % No SInE strategy applied
% 0.93/0.65  % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.93/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.93/0.65  % Starting new_bool_3 with 136s (1) cores
% 0.93/0.65  % Starting new_bool_1 with 136s (1) cores
% 0.93/0.65  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1050540 completed with status 0
% 0.93/0.65  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.93/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.65  % No SInE strategy applied
% 0.93/0.65  % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.93/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.93/0.65  % Preprocessing time       : 0.001 s
% 0.93/0.65  % Presaturation interreduction done
% 0.93/0.65  
% 0.93/0.65  % Proof found!
% 0.93/0.65  % SZS status Unsatisfiable
% 0.93/0.65  % SZS output start CNFRefutation
% See solution above
% 0.93/0.65  % Parsed axioms                        : 17
% 0.93/0.65  % Removed by relevancy pruning/SinE    : 0
% 0.93/0.65  % Initial clauses                      : 17
% 0.93/0.65  % Removed in clause preprocessing      : 0
% 0.93/0.65  % Initial clauses in saturation        : 17
% 0.93/0.65  % Processed clauses                    : 1083
% 0.93/0.65  % ...of these trivial                  : 567
% 0.93/0.65  % ...subsumed                          : 237
% 0.93/0.65  % ...remaining for further processing  : 279
% 0.93/0.65  % Other redundant clauses eliminated   : 0
% 0.93/0.65  % Clauses deleted for lack of memory   : 0
% 0.93/0.65  % Backward-subsumed                    : 0
% 0.93/0.65  % Backward-rewritten                   : 32
% 0.93/0.65  % Generated clauses                    : 21142
% 0.93/0.65  % ...of the previous two non-redundant : 12948
% 0.93/0.65  % ...aggressively subsumed             : 0
% 0.93/0.65  % Contextual simplify-reflections      : 0
% 0.93/0.65  % Paramodulations                      : 21142
% 0.93/0.65  % Factorizations                       : 0
% 0.93/0.65  % NegExts                              : 0
% 0.93/0.65  % Equation resolutions                 : 0
% 0.93/0.65  % Disequality decompositions           : 0
% 0.93/0.65  % Total rewrite steps                  : 24873
% 0.93/0.65  % ...of those cached                   : 17621
% 0.93/0.65  % Propositional unsat checks           : 0
% 0.93/0.65  %    Propositional check models        : 0
% 0.93/0.65  %    Propositional check unsatisfiable : 0
% 0.93/0.65  %    Propositional clauses             : 0
% 0.93/0.65  %    Propositional clauses after purity: 0
% 0.93/0.65  %    Propositional unsat core size     : 0
% 0.93/0.65  %    Propositional preprocessing time  : 0.000
% 0.93/0.65  %    Propositional encoding time       : 0.000
% 0.93/0.65  %    Propositional solver time         : 0.000
% 0.93/0.65  %    Success case prop preproc time    : 0.000
% 0.93/0.65  %    Success case prop encoding time   : 0.000
% 0.93/0.65  %    Success case prop solver time     : 0.000
% 0.93/0.65  % Current number of processed clauses  : 230
% 0.93/0.65  %    Positive orientable unit clauses  : 221
% 0.93/0.65  %    Positive unorientable unit clauses: 8
% 0.93/0.65  %    Negative unit clauses             : 1
% 0.93/0.65  %    Non-unit-clauses                  : 0
% 0.93/0.65  % Current number of unprocessed clauses: 11761
% 0.93/0.65  % ...number of literals in the above   : 11761
% 0.93/0.65  % Current number of archived formulas  : 0
% 0.93/0.65  % Current number of archived clauses   : 49
% 0.93/0.65  % Clause-clause subsumption calls (NU) : 0
% 0.93/0.65  % Rec. Clause-clause subsumption calls : 0
% 0.93/0.65  % Non-unit clause-clause subsumptions  : 0
% 0.93/0.65  % Unit Clause-clause subsumption calls : 54
% 0.93/0.65  % Rewrite failures with RHS unbound    : 0
% 0.93/0.65  % BW rewrite match attempts            : 829
% 0.93/0.65  % BW rewrite match successes           : 338
% 0.93/0.65  % Condensation attempts                : 0
% 0.93/0.65  % Condensation successes               : 0
% 0.93/0.65  % Termbank termtop insertions          : 289763
% 0.93/0.65  % Search garbage collected termcells   : 2
% 0.93/0.65  
% 0.93/0.65  % -------------------------------------------------
% 0.93/0.65  % User time                : 0.202 s
% 0.93/0.65  % System time              : 0.014 s
% 0.93/0.65  % Total time               : 0.216 s
% 0.93/0.65  % Maximum resident set size: 3640 pages
% 0.93/0.65  
% 0.93/0.65  % -------------------------------------------------
% 0.93/0.65  % User time                : 0.746 s
% 0.93/0.65  % System time              : 0.065 s
% 0.93/0.65  % Total time               : 0.811 s
% 0.93/0.65  % Maximum resident set size: 4864 pages
% 0.93/0.65  % E exiting
%------------------------------------------------------------------------------