TSTP Solution File: SET012-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET012-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n017.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 : Thu Aug 31 14:32:01 EDT 2023
% Result : Unsatisfiable 0.18s 0.60s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
empty_set: $i ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
member_of_1_not_of_2: ( $i * $i ) > $i ).
tff(decl_26,type,
complement: $i > $i ).
tff(decl_27,type,
union: ( $i * $i ) > $i ).
tff(decl_28,type,
intersection: ( $i * $i ) > $i ).
tff(decl_29,type,
equal_sets: ( $i * $i ) > $o ).
tff(decl_30,type,
equal_elements: ( $i * $i ) > $o ).
tff(decl_31,type,
a: $i ).
cnf(not_member_of_set_and_complement,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',not_member_of_set_and_complement) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
cnf(member_of_set_or_complement,axiom,
( member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_set_or_complement) ).
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
cnf(subsets_are_set_equal_sets,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
cnf(prove_involution,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_involution) ).
cnf(c_0_6,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
not_member_of_set_and_complement ).
cnf(c_0_7,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
subsets_axiom1 ).
cnf(c_0_8,plain,
( subset(complement(X1),X2)
| ~ member(member_of_1_not_of_2(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
( member(X1,X2)
| member(X1,complement(X2)) ),
member_of_set_or_complement ).
cnf(c_0_10,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
subsets_axiom2 ).
cnf(c_0_11,plain,
( subset(complement(complement(X1)),X2)
| member(member_of_1_not_of_2(complement(complement(X1)),X2),X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,complement(X2))
| member(member_of_1_not_of_2(X1,complement(X2)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
subsets_are_set_equal_sets ).
cnf(c_0_14,plain,
subset(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( subset(X1,complement(complement(X2)))
| ~ member(member_of_1_not_of_2(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_16,plain,
( equal_sets(complement(complement(X1)),X1)
| ~ subset(X1,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
subset(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
prove_involution ).
cnf(c_0_19,plain,
equal_sets(complement(complement(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET012-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Aug 26 13:15:25 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.54 start to proof: theBenchmark
% 0.18/0.60 % Version : CSE_E---1.5
% 0.18/0.60 % Problem : theBenchmark.p
% 0.18/0.60 % Proof found
% 0.18/0.60 % SZS status Theorem for theBenchmark.p
% 0.18/0.60 % SZS output start Proof
% See solution above
% 0.18/0.60 % Total time : 0.045000 s
% 0.18/0.60 % SZS output end Proof
% 0.18/0.60 % Total time : 0.048000 s
%------------------------------------------------------------------------------