TSTP Solution File: SET599+3 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SET599+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 03:00:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).

fof(f2,axiom,
    ! [X0,X1] : subset(X0,union(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).

fof(f9,conjecture,
    ! [X0,X1] : subset(difference(X0,X1),symmetric_difference(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th58) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] : subset(difference(X0,X1),symmetric_difference(X0,X1)),
    inference(negated_conjecture,[],[f9]) ).

fof(f12,plain,
    ? [X0,X1] : ~ subset(difference(X0,X1),symmetric_difference(X0,X1)),
    inference(ennf_transformation,[],[f10]) ).

fof(f23,plain,
    ( ? [X0,X1] : ~ subset(difference(X0,X1),symmetric_difference(X0,X1))
   => ~ subset(difference(sK2,sK3),symmetric_difference(sK2,sK3)) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ~ subset(difference(sK2,sK3),symmetric_difference(sK2,sK3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f12,f23]) ).

fof(f25,plain,
    ! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    inference(cnf_transformation,[],[f1]) ).

fof(f26,plain,
    ! [X0,X1] : subset(X0,union(X0,X1)),
    inference(cnf_transformation,[],[f2]) ).

fof(f40,plain,
    ~ subset(difference(sK2,sK3),symmetric_difference(sK2,sK3)),
    inference(cnf_transformation,[],[f24]) ).

fof(f42,plain,
    ~ subset(difference(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
    inference(definition_unfolding,[],[f40,f25]) ).

cnf(c_49,plain,
    subset(X0,union(X0,X1)),
    inference(cnf_transformation,[],[f26]) ).

cnf(c_61,negated_conjecture,
    ~ subset(difference(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
    inference(cnf_transformation,[],[f42]) ).

cnf(c_74,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_61,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : SET599+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 20:19:34 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.87/1.13  % SZS status Started for theBenchmark.p
% 0.87/1.13  % SZS status Theorem for theBenchmark.p
% 0.87/1.13  
% 0.87/1.13  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.87/1.13  
% 0.87/1.13  ------  iProver source info
% 0.87/1.13  
% 0.87/1.13  git: date: 2024-05-02 19:28:25 +0000
% 0.87/1.13  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.87/1.13  git: non_committed_changes: false
% 0.87/1.13  
% 0.87/1.13  ------ Parsing...
% 0.87/1.13  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.87/1.13  
% 0.87/1.13  ------ Preprocessing...
% 0.87/1.13  
% 0.87/1.13  % SZS status Theorem for theBenchmark.p
% 0.87/1.13  
% 0.87/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.13  
% 0.87/1.13  
%------------------------------------------------------------------------------