TSTP Solution File: SET002-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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:31:55 EDT 2023
% Result : Unsatisfiable 0.17s 0.59s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 30 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 45 ( 22 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 32 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
member: ( $i * $i ) > $o ).
tff(decl_23,type,
subset: ( $i * $i ) > $o ).
tff(decl_24,type,
member_of_1_not_of_2: ( $i * $i ) > $i ).
tff(decl_25,type,
equal_sets: ( $i * $i ) > $o ).
tff(decl_26,type,
union: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
g: ( $i * $i * $i ) > $i ).
tff(decl_28,type,
a: $i ).
tff(decl_29,type,
aUa: $i ).
cnf(member_of_set2_is_member_of_union,axiom,
( member(X4,X3)
| ~ union(X1,X2,X3)
| ~ member(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',member_of_set2_is_member_of_union) ).
cnf(a_union_a_is_aUa,hypothesis,
union(a,a,aUa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_union_a_is_aUa) ).
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom2) ).
cnf(member_of_union_is_member_of_one_set,axiom,
( member(X4,X1)
| member(X4,X2)
| ~ union(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',member_of_union_is_member_of_one_set) ).
cnf(prove_a_equals_aUa,negated_conjecture,
~ equal_sets(aUa,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_aUa) ).
cnf(subsets_are_set_equal_sets,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_are_set_equal_sets) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom1) ).
cnf(c_0_7,axiom,
( member(X4,X3)
| ~ union(X1,X2,X3)
| ~ member(X4,X2) ),
member_of_set2_is_member_of_union ).
cnf(c_0_8,hypothesis,
union(a,a,aUa),
a_union_a_is_aUa ).
cnf(c_0_9,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
subsets_axiom2 ).
cnf(c_0_10,hypothesis,
( member(X1,aUa)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( member(X4,X1)
| member(X4,X2)
| ~ union(X1,X2,X3)
| ~ member(X4,X3) ),
member_of_union_is_member_of_one_set ).
cnf(c_0_12,negated_conjecture,
~ equal_sets(aUa,a),
prove_a_equals_aUa ).
cnf(c_0_13,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
subsets_are_set_equal_sets ).
cnf(c_0_14,hypothesis,
( subset(X1,aUa)
| ~ member(member_of_1_not_of_2(X1,aUa),a) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
subsets_axiom1 ).
cnf(c_0_16,hypothesis,
( member(X1,a)
| ~ member(X1,aUa) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(aUa,a)
| ~ subset(a,aUa) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
subset(a,aUa),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
( subset(aUa,X1)
| member(member_of_1_not_of_2(aUa,X1),a) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ subset(aUa,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n005.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 : Sat Aug 26 16:27:08 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.57 start to proof: theBenchmark
% 0.17/0.59 % Version : CSE_E---1.5
% 0.17/0.59 % Problem : theBenchmark.p
% 0.17/0.59 % Proof found
% 0.17/0.59 % SZS status Theorem for theBenchmark.p
% 0.17/0.59 % SZS output start Proof
% See solution above
% 0.17/0.59 % Total time : 0.004000 s
% 0.17/0.59 % SZS output end Proof
% 0.17/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------