↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET633+3 : 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 : 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 02:14:49 PM UTC 2026

% Result   : Theorem 0.13s 0.44s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   28 (   3 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   23 (   9   ~;   6   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th115,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(difference(X2,X1),X3)
        & subset(difference(X1,X2),X3) )
     => subset(symmetric_difference(X1,X2),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th115) ).

fof(union_subset,axiom,
    ! [X1,X2,X3] :
      ( ( subset(X3,X2)
        & subset(X1,X2) )
     => subset(union(X1,X3),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_subset) ).

fof(symmetric_difference_defn,axiom,
    ! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_difference_defn) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(difference(X2,X1),X3)
          & subset(difference(X1,X2),X3) )
       => subset(symmetric_difference(X1,X2),X3) ),
    inference(assume_negation,[status(cth)],[prove_th115]) ).

fof(c_0_4,plain,
    ! [X7,X8,X9] :
      ( subset(union(X7,X9),X8)
      | ~ subset(X9,X8)
      | ~ subset(X7,X8) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_subset])])]) ).

fof(c_0_5,plain,
    ! [X17,X18] : symmetric_difference(X17,X18) = union(difference(X17,X18),difference(X18,X17)),
    inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).

fof(c_0_6,negated_conjecture,
    ( ~ subset(symmetric_difference(esk1_0,esk2_0),esk3_0)
    & subset(difference(esk2_0,esk1_0),esk3_0)
    & subset(difference(esk1_0,esk2_0),esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

cnf(c_0_7,plain,
    ( ~ subset(X3,X2)
    | ~ subset(X1,X2)
    | subset(union(X1,X3),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ subset(symmetric_difference(esk1_0,esk2_0),esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ subset(difference(X1,X2),X3)
    | ~ subset(difference(X2,X1),X3)
    | subset(symmetric_difference(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    subset(difference(esk2_0,esk1_0),esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    subset(difference(esk1_0,esk2_0),esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET633+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/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 : Mon Sep 21 05:30:21 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/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.13/0.44  % Version: 3.5.1
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44  % Starting sh5l with 300s (1) cores
% 0.13/0.44  % sh5l with pid 3230827 completed with status 0
% 0.13/0.44  % Result found by sh5l
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44  % Starting sh5l with 300s (1) cores
% 0.13/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.44  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.44  % Search class: FGHSM-FFSF22-SFFFFFNN
% 0.13/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44  % SubtermCWHack with pid 3230828 completed with status 0
% 0.13/0.44  % Result found by SubtermCWHack
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44  % Starting sh5l with 300s (1) cores
% 0.13/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.44  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.44  % Search class: FGHSM-FFSF22-SFFFFFNN
% 0.13/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44  % Preprocessing time       : 0.001 s
% 0.13/0.44  
% 0.13/0.44  % Proof found!
% 0.13/0.44  % SZS status Theorem
% 0.13/0.44  % SZS output start CNFRefutation
% See solution above
% 0.13/0.44  % Parsed axioms                        : 9
% 0.13/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.44  % Initial clauses                      : 18
% 0.13/0.44  % Removed in clause preprocessing      : 2
% 0.13/0.44  % Initial clauses in saturation        : 16
% 0.13/0.44  % Processed clauses                    : 47
% 0.13/0.44  % ...of these trivial                  : 0
% 0.13/0.44  % ...subsumed                          : 9
% 0.13/0.44  % ...remaining for further processing  : 38
% 0.13/0.44  % Other redundant clauses eliminated   : 0
% 0.13/0.44  % Clauses deleted for lack of memory   : 0
% 0.13/0.44  % Backward-subsumed                    : 0
% 0.13/0.44  % Backward-rewritten                   : 0
% 0.13/0.44  % Generated clauses                    : 93
% 0.13/0.44  % ...of the previous two non-redundant : 74
% 0.13/0.44  % ...aggressively subsumed             : 0
% 0.13/0.44  % Contextual simplify-reflections      : 0
% 0.13/0.44  % Paramodulations                      : 91
% 0.13/0.44  % Factorizations                       : 2
% 0.13/0.44  % NegExts                              : 0
% 0.13/0.44  % Equation resolutions                 : 0
% 0.13/0.44  % Disequality decompositions           : 0
% 0.13/0.44  % Total rewrite steps                  : 11
% 0.13/0.44  % ...of those cached                   : 4
% 0.13/0.44  % Propositional unsat checks           : 0
% 0.13/0.44  %    Propositional check models        : 0
% 0.13/0.44  %    Propositional check unsatisfiable : 0
% 0.13/0.44  %    Propositional clauses             : 0
% 0.13/0.44  %    Propositional clauses after purity: 0
% 0.13/0.44  %    Propositional unsat core size     : 0
% 0.13/0.44  %    Propositional preprocessing time  : 0.000
% 0.13/0.44  %    Propositional encoding time       : 0.000
% 0.13/0.44  %    Propositional solver time         : 0.000
% 0.13/0.44  %    Success case prop preproc time    : 0.000
% 0.13/0.44  %    Success case prop encoding time   : 0.000
% 0.13/0.44  %    Success case prop solver time     : 0.000
% 0.13/0.44  % Current number of processed clauses  : 38
% 0.13/0.44  %    Positive orientable unit clauses  : 7
% 0.13/0.44  %    Positive unorientable unit clauses: 2
% 0.13/0.44  %    Negative unit clauses             : 1
% 0.13/0.44  %    Non-unit-clauses                  : 28
% 0.13/0.44  % Current number of unprocessed clauses: 42
% 0.13/0.44  % ...number of literals in the above   : 125
% 0.13/0.44  % Current number of archived formulas  : 0
% 0.13/0.44  % Current number of archived clauses   : 0
% 0.13/0.44  % Clause-clause subsumption calls (NU) : 99
% 0.13/0.44  % Rec. Clause-clause subsumption calls : 95
% 0.13/0.44  % Non-unit clause-clause subsumptions  : 7
% 0.13/0.44  % Unit Clause-clause subsumption calls : 3
% 0.13/0.44  % Rewrite failures with RHS unbound    : 0
% 0.13/0.44  % BW rewrite match attempts            : 9
% 0.13/0.44  % BW rewrite match successes           : 2
% 0.13/0.44  % Condensation attempts                : 0
% 0.13/0.44  % Condensation successes               : 0
% 0.13/0.44  % Termbank termtop insertions          : 2338
% 0.13/0.44  % Search garbage collected termcells   : 282
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.006 s
% 0.13/0.44  % System time              : 0.001 s
% 0.13/0.44  % Total time               : 0.008 s
% 0.13/0.44  % Maximum resident set size: 3636 pages
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.007 s
% 0.13/0.44  % System time              : 0.006 s
% 0.13/0.44  % Total time               : 0.014 s
% 0.13/0.44  % Maximum resident set size: 4864 pages
% 0.13/0.44  % E exiting
%------------------------------------------------------------------------------