↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM061-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n023.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 : Tue May  5 04:52:47 PM UTC 2026

% Result   : Unsatisfiable 3.73s 3.13s
% Output   : CNFRefutation 3.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   55 (  33 unt;   6 nHn;  32 RR)
%            Number of literals    :   88 (  22 equ;  39 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-3 aty)
%            Number of variables   :   83 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(segment,axiom,
    segment(X1,X2,X3) = domain_of(restrict(X1,X2,singleton(X3))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',segment) ).

cnf(singleton_set,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).

cnf(restriction1,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).

cnf(regularity1,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).

cnf(prove_segments_property5_4,negated_conjecture,
    ~ member(u,segment(xr,y,z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_segments_property5_4) ).

cnf(domain2,axiom,
    ( restrict(X2,singleton(X1),universal_class) = null_class
    | member(X1,domain_of(X2))
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',domain2) ).

cnf(restriction2,axiom,
    intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).

cnf(prove_segments_property5_2,negated_conjecture,
    member(u,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_segments_property5_2) ).

cnf(ordered_pair,axiom,
    unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

cnf(intersection3,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).

cnf(cartesian_product3,axiom,
    ( member(ordered_pair(X1,X3),cross_product(X2,X4))
    | ~ member(X1,X2)
    | ~ member(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).

cnf(prove_segments_property5_3,negated_conjecture,
    member(z,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_segments_property5_3) ).

cnf(unordered_pair2,axiom,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).

cnf(prove_segments_property5_1,negated_conjecture,
    member(ordered_pair(u,z),xr),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_segments_property5_1) ).

cnf(c_0_17,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    subclass_members ).

cnf(c_0_18,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

cnf(c_0_19,axiom,
    segment(X1,X2,X3) = domain_of(restrict(X1,X2,singleton(X3))),
    segment ).

cnf(c_0_20,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    singleton_set ).

cnf(c_0_21,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    restriction1 ).

cnf(c_0_22,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    complement1 ).

cnf(c_0_23,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    regularity1 ).

cnf(c_0_24,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ~ member(u,segment(xr,y,z)),
    prove_segments_property5_4 ).

cnf(c_0_26,plain,
    segment(X1,X2,X3) = domain_of(intersection(X1,cross_product(X2,unordered_pair(X3,X3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_27,axiom,
    ( restrict(X2,singleton(X1),universal_class) = null_class
    | member(X1,domain_of(X2))
    | ~ member(X1,universal_class) ),
    domain2 ).

cnf(c_0_28,axiom,
    intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
    restriction2 ).

cnf(c_0_29,negated_conjecture,
    member(u,y),
    prove_segments_property5_2 ).

cnf(c_0_30,plain,
    ( complement(X1) = null_class
    | ~ member(regular(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_31,plain,
    ( X1 = null_class
    | member(regular(X1),universal_class) ),
    inference(spm,[status(thm)],[c_0_24,c_0_23]) ).

cnf(c_0_32,negated_conjecture,
    ~ member(u,domain_of(intersection(xr,cross_product(y,unordered_pair(z,z))))),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_33,plain,
    ( intersection(X2,cross_product(unordered_pair(X1,X1),universal_class)) = null_class
    | member(X1,domain_of(X2))
    | ~ member(X1,universal_class) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_20]),c_0_21]) ).

cnf(c_0_34,plain,
    intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
    inference(rw,[status(thm)],[c_0_28,c_0_21]) ).

cnf(c_0_35,negated_conjecture,
    member(u,universal_class),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_36,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,axiom,
    unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
    ordered_pair ).

cnf(c_0_38,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    intersection3 ).

cnf(c_0_39,negated_conjecture,
    intersection(cross_product(unordered_pair(u,u),universal_class),intersection(xr,cross_product(y,unordered_pair(z,z)))) = null_class,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).

cnf(c_0_40,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_36]),c_0_24]) ).

cnf(c_0_41,axiom,
    ( member(ordered_pair(X1,X3),cross_product(X2,X4))
    | ~ member(X1,X2)
    | ~ member(X3,X4) ),
    cartesian_product3 ).

cnf(c_0_42,plain,
    unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_20]),c_0_20]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ member(X1,intersection(xr,cross_product(y,unordered_pair(z,z))))
    | ~ member(X1,cross_product(unordered_pair(u,u),universal_class)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_44,plain,
    ( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4))
    | ~ member(X3,X4)
    | ~ member(X1,X2) ),
    inference(rw,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),intersection(xr,cross_product(y,unordered_pair(z,z))))
    | ~ member(X1,unordered_pair(u,u))
    | ~ member(X2,universal_class) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_46,negated_conjecture,
    member(z,universal_class),
    prove_segments_property5_3 ).

cnf(c_0_47,negated_conjecture,
    ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(z,z))),intersection(xr,cross_product(y,unordered_pair(z,z))))
    | ~ member(X1,unordered_pair(u,u)) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,axiom,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    unordered_pair2 ).

cnf(c_0_49,negated_conjecture,
    member(ordered_pair(u,z),xr),
    prove_segments_property5_1 ).

cnf(c_0_50,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(z,z))),intersection(xr,cross_product(y,unordered_pair(z,z)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_35])]) ).

cnf(c_0_51,negated_conjecture,
    member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(z,z))),xr),
    inference(rw,[status(thm)],[c_0_49,c_0_42]) ).

cnf(c_0_52,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(z,z))),cross_product(y,unordered_pair(z,z))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_38]),c_0_51])]) ).

cnf(c_0_53,negated_conjecture,
    ~ member(z,unordered_pair(z,z)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_29])]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_48]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : NUM061-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.12/0.14  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.35  % Computer : n023.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit   : 300
% 0.16/0.35  % WCLimit    : 300
% 0.16/0.35  % DateTime   : Tue May  5 00:08:23 EDT 2026
% 0.16/0.35  % CPUTime    : 
% 0.16/0.36  % start to proof: theBenchmark
% 3.73/3.13  % Version  : CSE_E---1.7
% 3.73/3.13  % Problem  : theBenchmark.p
% 3.73/3.13  % SZS status Unsatisfiable for theBenchmark.p
% 3.73/3.13  % SZS output start CNFRefutation
% See solution above
% 3.73/3.14  % Total time : 2.375s
%------------------------------------------------------------------------------