↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n014.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:18 PM UTC 2026

% Result   : Unsatisfiable 0.72s 0.58s
% Output   : CNFRefutation 0.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   47 (  47 unt;   0 nHn;   4 RR)
%            Number of literals    :   47 (  46 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   13 (   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   :  116 (  23 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(prove_wal_axioms_4,negated_conjecture,
    join(b,a) != join(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wal_axioms_4) ).

cnf(c_0_2,axiom,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    single_axiom ).

cnf(c_0_3,plain,
    join(meet(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4),meet(join(meet(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))),meet(X3,join(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))))),join(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4))) = join(meet(X2,X3),meet(X3,join(X2,X3))),
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_4,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)),meet(X9,join(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)))),join(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_3,c_0_2]) ).

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

cnf(c_0_6,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

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

cnf(c_0_8,plain,
    join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).

cnf(c_0_9,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_10,plain,
    join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)),meet(X5,join(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)))),join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).

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

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

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

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

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

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

cnf(c_0_17,plain,
    meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_2]),c_0_12]),c_0_12]),c_0_12]) ).

cnf(c_0_18,plain,
    meet(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_13]) ).

cnf(c_0_19,plain,
    join(meet(X1,X1),join(X1,X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13]) ).

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

cnf(c_0_21,plain,
    meet(join(X1,X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_22,plain,
    join(X1,join(X1,X1)) = X1,
    inference(rw,[status(thm)],[c_0_19,c_0_18]) ).

cnf(c_0_23,plain,
    join(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]) ).

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

cnf(c_0_25,plain,
    join(X1,meet(X2,X1)) = X1,
    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_23]),c_0_16]),c_0_18]),c_0_16]),c_0_23]) ).

cnf(c_0_26,plain,
    meet(meet(X1,meet(X2,X1)),meet(X2,X1)) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_15]),c_0_15]),c_0_15]) ).

cnf(c_0_27,plain,
    meet(meet(X1,meet(X2,X1)),X1) = meet(X1,meet(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]),c_0_23]) ).

cnf(c_0_28,plain,
    meet(X1,meet(X2,X1)) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_25]),c_0_25]) ).

cnf(c_0_29,plain,
    meet(meet(X1,X2),X2) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).

cnf(c_0_30,plain,
    meet(join(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[c_0_16,c_0_29]) ).

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

cnf(c_0_32,plain,
    meet(X1,join(meet(X1,X2),X1)) = join(meet(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_30,c_0_20]) ).

cnf(c_0_33,plain,
    meet(join(meet(X1,X2),X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,plain,
    join(meet(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_33]),c_0_20]),c_0_33]),c_0_23]) ).

cnf(c_0_35,plain,
    meet(meet(X1,X2),X1) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_34]),c_0_23]) ).

cnf(c_0_36,plain,
    join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
    inference(spm,[status(thm)],[c_0_15,c_0_28]) ).

cnf(c_0_37,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(rw,[status(thm)],[c_0_31,c_0_35]) ).

cnf(c_0_38,plain,
    join(X1,meet(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_25,c_0_35]) ).

cnf(c_0_39,plain,
    join(join(X1,meet(X2,join(X3,X1))),join(X3,X1)) = join(X3,X1),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,plain,
    meet(X1,join(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_35,c_0_30]) ).

cnf(c_0_41,negated_conjecture,
    join(b,a) != join(a,b),
    inference(fof_simplification,[status(thm)],[prove_wal_axioms_4]) ).

cnf(c_0_42,plain,
    join(join(X1,X2),X1) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_38,c_0_30]) ).

cnf(c_0_43,plain,
    join(join(X1,X2),join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,negated_conjecture,
    join(b,a) != join(a,b),
    c_0_41 ).

cnf(c_0_45,plain,
    join(X1,X2) = join(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT095-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 23:11:49 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42  Running first-order theorem proving
% 0.09/0.42  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.72/0.58  % Version: 3.5.1
% 0.72/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.72/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.72/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.72/0.58  % Starting new_bool_1 with 300s (1) cores
% 0.72/0.58  % Starting sh5l with 300s (1) cores
% 0.72/0.58  % new_bool_3 with pid 2566493 completed with status 9
% 0.72/0.58  % new_bool_1 with pid 2566494 completed with status 9
% 0.72/0.58  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2566492 completed with status 0
% 0.72/0.58  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.72/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.72/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.72/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.72/0.58  % No SInE strategy applied
% 0.72/0.58  % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.72/0.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.72/0.58  % Starting SubtermCWHack with 136s (1) cores
% 0.72/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.72/0.58  % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.72/0.58  % Starting new_bool_3 with 136s (1) cores
% 0.72/0.58  % Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.72/0.58  % G----_0008_C18_F1_SE_CS_SP_S0Y with pid 2566500 completed with status 0
% 0.72/0.58  % Result found by G----_0008_C18_F1_SE_CS_SP_S0Y
% 0.72/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.72/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.72/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.72/0.58  % No SInE strategy applied
% 0.72/0.58  % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.72/0.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.72/0.58  % Starting SubtermCWHack with 136s (1) cores
% 0.72/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.72/0.58  % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.72/0.58  % Preprocessing time       : 0.002 s
% 0.72/0.58  
% 0.72/0.58  % Proof found!
% 0.72/0.58  % SZS status Unsatisfiable
% 0.72/0.58  % SZS output start CNFRefutation
% See solution above
% 0.72/0.58  % Parsed axioms                        : 2
% 0.72/0.58  % Removed by relevancy pruning/SinE    : 0
% 0.72/0.58  % Initial clauses                      : 2
% 0.72/0.58  % Removed in clause preprocessing      : 0
% 0.72/0.58  % Initial clauses in saturation        : 2
% 0.72/0.58  % Processed clauses                    : 200
% 0.72/0.58  % ...of these trivial                  : 114
% 0.72/0.58  % ...subsumed                          : 5
% 0.72/0.58  % ...remaining for further processing  : 81
% 0.72/0.58  % Other redundant clauses eliminated   : 0
% 0.72/0.58  % Clauses deleted for lack of memory   : 0
% 0.72/0.58  % Backward-subsumed                    : 0
% 0.72/0.58  % Backward-rewritten                   : 52
% 0.72/0.58  % Generated clauses                    : 4327
% 0.72/0.58  % ...of the previous two non-redundant : 2029
% 0.72/0.58  % ...aggressively subsumed             : 0
% 0.72/0.58  % Contextual simplify-reflections      : 0
% 0.72/0.58  % Paramodulations                      : 4327
% 0.72/0.58  % Factorizations                       : 0
% 0.72/0.58  % NegExts                              : 0
% 0.72/0.58  % Equation resolutions                 : 0
% 0.72/0.58  % Disequality decompositions           : 0
% 0.72/0.58  % Total rewrite steps                  : 19509
% 0.72/0.58  % ...of those cached                   : 17941
% 0.72/0.58  % Propositional unsat checks           : 0
% 0.72/0.58  %    Propositional check models        : 0
% 0.72/0.58  %    Propositional check unsatisfiable : 0
% 0.72/0.58  %    Propositional clauses             : 0
% 0.72/0.58  %    Propositional clauses after purity: 0
% 0.72/0.58  %    Propositional unsat core size     : 0
% 0.72/0.58  %    Propositional preprocessing time  : 0.000
% 0.72/0.58  %    Propositional encoding time       : 0.000
% 0.72/0.58  %    Propositional solver time         : 0.000
% 0.72/0.58  %    Success case prop preproc time    : 0.000
% 0.72/0.58  %    Success case prop encoding time   : 0.000
% 0.72/0.58  %    Success case prop solver time     : 0.000
% 0.72/0.58  % Current number of processed clauses  : 29
% 0.72/0.58  %    Positive orientable unit clauses  : 27
% 0.72/0.58  %    Positive unorientable unit clauses: 2
% 0.72/0.58  %    Negative unit clauses             : 0
% 0.72/0.58  %    Non-unit-clauses                  : 0
% 0.72/0.58  % Current number of unprocessed clauses: 1691
% 0.72/0.58  % ...number of literals in the above   : 1691
% 0.72/0.58  % Current number of archived formulas  : 0
% 0.72/0.58  % Current number of archived clauses   : 52
% 0.72/0.58  % Clause-clause subsumption calls (NU) : 0
% 0.72/0.58  % Rec. Clause-clause subsumption calls : 0
% 0.72/0.58  % Non-unit clause-clause subsumptions  : 0
% 0.72/0.58  % Unit Clause-clause subsumption calls : 38
% 0.72/0.58  % Rewrite failures with RHS unbound    : 0
% 0.72/0.58  % BW rewrite match attempts            : 482
% 0.72/0.58  % BW rewrite match successes           : 182
% 0.72/0.58  % Condensation attempts                : 0
% 0.72/0.58  % Condensation successes               : 0
% 0.72/0.58  % Termbank termtop insertions          : 243140
% 0.72/0.58  % Search garbage collected termcells   : 2
% 0.72/0.58  
% 0.72/0.58  % -------------------------------------------------
% 0.72/0.58  % User time                : 0.134 s
% 0.72/0.58  % System time              : 0.010 s
% 0.72/0.58  % Total time               : 0.144 s
% 0.72/0.58  % Maximum resident set size: 3640 pages
% 0.72/0.58  
% 0.72/0.58  % -------------------------------------------------
% 0.72/0.58  % User time                : 0.668 s
% 0.72/0.58  % System time              : 0.066 s
% 0.72/0.58  % Total time               : 0.734 s
% 0.72/0.58  % Maximum resident set size: 4864 pages
% 0.72/0.58  % E exiting
%------------------------------------------------------------------------------