TSTP Solution File: SET012-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET012-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:17:51 EDT 2023
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 11 unt; 8 nHn; 32 RR)
% Number of literals : 74 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(membership_in_subsets,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',membership_in_subsets) ).
cnf(set_equal_sets_are_subsets2,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',set_equal_sets_are_subsets2) ).
cnf(symmetry_for_set_equal,axiom,
( equal_sets(X2,X1)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',symmetry_for_set_equal) ).
cnf(complement_of_b_is_c,hypothesis,
equal_sets(complement(b),c),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',complement_of_b_is_c) ).
cnf(complement_of_a_is_b,hypothesis,
equal_sets(complement(a),b),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',complement_of_a_is_b) ).
cnf(member_of_set_or_complement,axiom,
( member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',member_of_set_or_complement) ).
cnf(not_member_of_set_and_complement,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',not_member_of_set_and_complement) ).
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',subsets_axiom2) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',subsets_axiom1) ).
cnf(subsets_are_set_equal_sets,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',subsets_are_set_equal_sets) ).
cnf(prove_a_equals_c,negated_conjecture,
~ equal_sets(a,c),
file('/export/starexec/sandbox2/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p',prove_a_equals_c) ).
cnf(c_0_11,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
membership_in_subsets ).
cnf(c_0_12,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
set_equal_sets_are_subsets2 ).
cnf(c_0_13,axiom,
( equal_sets(X2,X1)
| ~ equal_sets(X1,X2) ),
symmetry_for_set_equal ).
cnf(c_0_14,hypothesis,
equal_sets(complement(b),c),
complement_of_b_is_c ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ equal_sets(X2,X3)
| ~ member(X1,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
equal_sets(c,complement(b)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
equal_sets(complement(a),b),
complement_of_a_is_b ).
cnf(c_0_18,hypothesis,
( member(X1,c)
| ~ member(X1,complement(b)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( member(X1,X2)
| member(X1,complement(X2)) ),
member_of_set_or_complement ).
cnf(c_0_20,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
not_member_of_set_and_complement ).
cnf(c_0_21,hypothesis,
( member(X1,complement(b))
| ~ member(X1,c) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,hypothesis,
equal_sets(b,complement(a)),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_23,hypothesis,
( member(X1,complement(a))
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
subsets_axiom2 ).
cnf(c_0_25,hypothesis,
( member(X1,b)
| member(X1,c) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
( ~ member(X1,b)
| ~ member(X1,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
subsets_axiom1 ).
cnf(c_0_28,hypothesis,
( member(X1,b)
| ~ member(X1,complement(a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_29,hypothesis,
( ~ member(X1,a)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_30,hypothesis,
( subset(X1,c)
| member(member_of_1_not_of_2(X1,c),b) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
( subset(c,X1)
| ~ member(member_of_1_not_of_2(c,X1),b) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,hypothesis,
( member(X1,a)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_33,hypothesis,
( subset(X1,c)
| ~ member(member_of_1_not_of_2(X1,c),a) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
( subset(c,X1)
| member(member_of_1_not_of_2(c,X1),a) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
subsets_are_set_equal_sets ).
cnf(c_0_36,hypothesis,
subset(a,c),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_37,hypothesis,
subset(c,a),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ equal_sets(a,c),
prove_a_equals_c ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET012-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 17:49:43 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.yXqd2cTRXp/E---3.1_30588.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30666 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHNS-FFSF21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.47 # Starting sh5l with 136s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30673 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHNS-FFSF21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Unsatisfiable
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 24
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 24
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 24
% 0.17/0.47 # Processed clauses : 531
% 0.17/0.47 # ...of these trivial : 5
% 0.17/0.47 # ...subsumed : 226
% 0.17/0.47 # ...remaining for further processing : 300
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 5
% 0.17/0.47 # Backward-rewritten : 7
% 0.17/0.47 # Generated clauses : 1913
% 0.17/0.47 # ...of the previous two non-redundant : 1722
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 5
% 0.17/0.47 # Paramodulations : 1905
% 0.17/0.47 # Factorizations : 8
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Total rewrite steps : 204
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 264
% 0.17/0.47 # Positive orientable unit clauses : 67
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 7
% 0.17/0.47 # Non-unit-clauses : 190
% 0.17/0.47 # Current number of unprocessed clauses: 1217
% 0.17/0.47 # ...number of literals in the above : 2805
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 36
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 6915
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 5609
% 0.17/0.47 # Non-unit clause-clause subsumptions : 201
% 0.17/0.47 # Unit Clause-clause subsumption calls : 693
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 62
% 0.17/0.47 # BW rewrite match successes : 7
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 24284
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.036 s
% 0.17/0.47 # System time : 0.001 s
% 0.17/0.47 # Total time : 0.037 s
% 0.17/0.47 # Maximum resident set size: 1640 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.178 s
% 0.17/0.47 # System time : 0.008 s
% 0.17/0.47 # Total time : 0.187 s
% 0.17/0.47 # Maximum resident set size: 1688 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------