↑ Up

E---3.5.1.UNS-CRf.s

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

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

% Result   : Unsatisfiable 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   23 (  19 unt;   0 nHn;   9 RR)
%            Number of literals    :   27 (  26 equ;   8 neg)
%            Maximal clause size   :    2 (   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;   3 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).

cnf(maddux4_definiton_of_meet_4,axiom,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).

cnf(maddux1_join_commutativity_1,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).

cnf(goals_15,negated_conjecture,
    ( join(sk1,sk3) != sk3
    | join(sk1,sk2) != sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).

cnf(maddux2_join_associativity_2,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).

cnf(goals_14,negated_conjecture,
    join(sk1,meet(sk2,sk3)) = meet(sk2,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).

cnf(c_0_6,axiom,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    maddux3_a_kind_of_de_Morgan_3 ).

cnf(c_0_7,axiom,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    maddux4_definiton_of_meet_4 ).

cnf(c_0_8,axiom,
    join(X1,X2) = join(X2,X1),
    maddux1_join_commutativity_1 ).

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

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

cnf(c_0_11,plain,
    meet(X1,X2) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( join(sk1,sk3) != sk3
    | join(sk1,sk2) != sk2 ),
    inference(fof_simplification,[status(thm)],[goals_15]) ).

cnf(c_0_13,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    maddux2_join_associativity_2 ).

cnf(c_0_14,negated_conjecture,
    join(sk1,meet(sk2,sk3)) = meet(sk2,sk3),
    goals_14 ).

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

cnf(c_0_16,negated_conjecture,
    ( join(sk1,sk3) != sk3
    | join(sk1,sk2) != sk2 ),
    c_0_12 ).

cnf(c_0_17,negated_conjecture,
    join(sk1,join(meet(sk2,sk3),X1)) = join(meet(sk2,sk3),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

cnf(c_0_19,negated_conjecture,
    ( join(sk3,sk1) != sk3
    | join(sk2,sk1) != sk2 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_8]),c_0_8]) ).

cnf(c_0_20,negated_conjecture,
    join(sk2,sk1) = sk2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_8]) ).

cnf(c_0_21,negated_conjecture,
    join(sk3,sk1) = sk3,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_8]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL046-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n002.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 : Mon Sep 21 04:11:31 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.43  % Version: 3.5.1
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % Starting sh5l with 300s (1) cores
% 0.15/0.43  % new_bool_1 with pid 2399410 completed with status 0
% 0.15/0.43  % Result found by new_bool_1
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % SubtermCWHack with pid 2399412 completed with status 0
% 0.15/0.43  % Result found by SubtermCWHack
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % Preprocessing time       : 0.001 s
% 0.15/0.43  
% 0.15/0.43  % Proof found!
% 0.15/0.43  % SZS status Unsatisfiable
% 0.15/0.43  % SZS output start CNFRefutation
% See solution above
% 0.15/0.43  % Parsed axioms                        : 15
% 0.15/0.43  % Removed by relevancy pruning/SinE    : 3
% 0.15/0.43  % Initial clauses                      : 12
% 0.15/0.43  % Removed in clause preprocessing      : 0
% 0.15/0.43  % Initial clauses in saturation        : 12
% 0.15/0.43  % Processed clauses                    : 93
% 0.15/0.43  % ...of these trivial                  : 13
% 0.15/0.43  % ...subsumed                          : 46
% 0.15/0.43  % ...remaining for further processing  : 33
% 0.15/0.43  % Other redundant clauses eliminated   : 0
% 0.15/0.43  % Clauses deleted for lack of memory   : 0
% 0.15/0.43  % Backward-subsumed                    : 0
% 0.15/0.43  % Backward-rewritten                   : 1
% 0.15/0.43  % Generated clauses                    : 438
% 0.15/0.43  % ...of the previous two non-redundant : 388
% 0.15/0.43  % ...aggressively subsumed             : 0
% 0.15/0.43  % Contextual simplify-reflections      : 0
% 0.15/0.43  % Paramodulations                      : 438
% 0.15/0.43  % Factorizations                       : 0
% 0.15/0.43  % NegExts                              : 0
% 0.15/0.43  % Equation resolutions                 : 0
% 0.15/0.43  % Disequality decompositions           : 0
% 0.15/0.43  % Total rewrite steps                  : 240
% 0.15/0.43  % ...of those cached                   : 127
% 0.15/0.43  % Propositional unsat checks           : 0
% 0.15/0.43  %    Propositional check models        : 0
% 0.15/0.43  %    Propositional check unsatisfiable : 0
% 0.15/0.43  %    Propositional clauses             : 0
% 0.15/0.43  %    Propositional clauses after purity: 0
% 0.15/0.43  %    Propositional unsat core size     : 0
% 0.15/0.43  %    Propositional preprocessing time  : 0.000
% 0.15/0.43  %    Propositional encoding time       : 0.000
% 0.15/0.43  %    Propositional solver time         : 0.000
% 0.15/0.43  %    Success case prop preproc time    : 0.000
% 0.15/0.43  %    Success case prop encoding time   : 0.000
% 0.15/0.43  %    Success case prop solver time     : 0.000
% 0.15/0.43  % Current number of processed clauses  : 32
% 0.15/0.43  %    Positive orientable unit clauses  : 27
% 0.15/0.43  %    Positive unorientable unit clauses: 5
% 0.15/0.43  %    Negative unit clauses             : 0
% 0.15/0.43  %    Non-unit-clauses                  : 0
% 0.15/0.43  % Current number of unprocessed clauses: 307
% 0.15/0.43  % ...number of literals in the above   : 307
% 0.15/0.43  % Current number of archived formulas  : 0
% 0.15/0.43  % Current number of archived clauses   : 1
% 0.15/0.43  % Clause-clause subsumption calls (NU) : 0
% 0.15/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.15/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  % Unit Clause-clause subsumption calls : 7
% 0.15/0.43  % Rewrite failures with RHS unbound    : 0
% 0.15/0.43  % BW rewrite match attempts            : 25
% 0.15/0.43  % BW rewrite match successes           : 17
% 0.15/0.43  % Condensation attempts                : 0
% 0.15/0.43  % Condensation successes               : 0
% 0.15/0.43  % Termbank termtop insertions          : 3936
% 0.15/0.43  % Search garbage collected termcells   : 14
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.005 s
% 0.15/0.43  % System time              : 0.004 s
% 0.15/0.43  % Total time               : 0.009 s
% 0.15/0.43  % Maximum resident set size: 3644 pages
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.008 s
% 0.15/0.43  % System time              : 0.007 s
% 0.15/0.43  % Total time               : 0.015 s
% 0.15/0.43  % Maximum resident set size: 4864 pages
% 0.15/0.43  % E exiting
%------------------------------------------------------------------------------