TSTP Solution File: SET010-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET010-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:50 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 53 ( 16 unt; 12 nHn; 51 RR)
% Number of literals : 119 ( 0 equ; 56 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-3 aty)
% Number of variables : 78 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(member_of_difference,axiom,
( member(X4,X1)
| ~ difference(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',member_of_difference) ).
cnf(c_minus_aIb,hypothesis,
difference(c,aIb,cD_aIb),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',c_minus_aIb) ).
cnf(prove_cDa_union_cDb_is_cD_aIb,negated_conjecture,
~ union(cDa,cDb,cD_aIb),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',prove_cDa_union_cDb_is_cD_aIb) ).
cnf(union_axiom1,axiom,
( union(X1,X2,X3)
| member(g(X1,X2,X3),X1)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',union_axiom1) ).
cnf(c_minus_b,hypothesis,
difference(c,b,cDb),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',c_minus_b) ).
cnf(c_minus_a,hypothesis,
difference(c,a,cDa),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',c_minus_a) ).
cnf(member_of_difference_or_set2,axiom,
( member(X1,X4)
| member(X1,X3)
| ~ member(X1,X2)
| ~ difference(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',member_of_difference_or_set2) ).
cnf(union_axiom3,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X2)
| ~ member(g(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',union_axiom3) ).
cnf(member_of_intersection_is_member_of_set2,axiom,
( member(X4,X2)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',member_of_intersection_is_member_of_set2) ).
cnf(a_intersection_b,hypothesis,
intersection(a,b,aIb),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',a_intersection_b) ).
cnf(union_axiom2,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X1)
| ~ member(g(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',union_axiom2) ).
cnf(member_of_intersection_is_member_of_set1,axiom,
( member(X4,X1)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',member_of_intersection_is_member_of_set1) ).
cnf(member_of_both_is_member_of_intersection,axiom,
( member(X4,X3)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',member_of_both_is_member_of_intersection) ).
cnf(not_member_of_difference,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ difference(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.eMm4S2i0LO/E---3.1_15507.p',not_member_of_difference) ).
cnf(c_0_14,axiom,
( member(X4,X1)
| ~ difference(X1,X2,X3)
| ~ member(X4,X3) ),
member_of_difference ).
cnf(c_0_15,hypothesis,
difference(c,aIb,cD_aIb),
c_minus_aIb ).
cnf(c_0_16,negated_conjecture,
~ union(cDa,cDb,cD_aIb),
prove_cDa_union_cDb_is_cD_aIb ).
cnf(c_0_17,axiom,
( union(X1,X2,X3)
| member(g(X1,X2,X3),X1)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X3) ),
union_axiom1 ).
cnf(c_0_18,hypothesis,
difference(c,b,cDb),
c_minus_b ).
cnf(c_0_19,hypothesis,
difference(c,a,cDa),
c_minus_a ).
cnf(c_0_20,axiom,
( member(X1,X4)
| member(X1,X3)
| ~ member(X1,X2)
| ~ difference(X2,X3,X4) ),
member_of_difference_or_set2 ).
cnf(c_0_21,hypothesis,
( member(X1,c)
| ~ member(X1,cD_aIb) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( member(g(cDa,cDb,cD_aIb),cDa)
| member(g(cDa,cDb,cD_aIb),cDb)
| member(g(cDa,cDb,cD_aIb),cD_aIb) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
( member(X1,c)
| ~ member(X1,cDb) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_24,hypothesis,
( member(X1,c)
| ~ member(X1,cDa) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_25,hypothesis,
( member(X1,aIb)
| member(X1,cD_aIb)
| ~ member(X1,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_26,hypothesis,
member(g(cDa,cDb,cD_aIb),c),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_27,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X2)
| ~ member(g(X1,X2,X3),X3) ),
union_axiom3 ).
cnf(c_0_28,hypothesis,
( member(g(cDa,cDb,cD_aIb),cD_aIb)
| member(g(cDa,cDb,cD_aIb),aIb) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
( member(X1,b)
| member(X1,cDb)
| ~ member(X1,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_30,axiom,
( member(X4,X2)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
member_of_intersection_is_member_of_set2 ).
cnf(c_0_31,hypothesis,
intersection(a,b,aIb),
a_intersection_b ).
cnf(c_0_32,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X1)
| ~ member(g(X1,X2,X3),X3) ),
union_axiom2 ).
cnf(c_0_33,hypothesis,
( member(X1,a)
| member(X1,cDa)
| ~ member(X1,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_34,axiom,
( member(X4,X1)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
member_of_intersection_is_member_of_set1 ).
cnf(c_0_35,axiom,
( member(X4,X3)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X4,X1) ),
member_of_both_is_member_of_intersection ).
cnf(c_0_36,hypothesis,
( member(g(cDa,cDb,cD_aIb),aIb)
| ~ member(g(cDa,cDb,cD_aIb),cDb) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16]) ).
cnf(c_0_37,hypothesis,
( member(g(cDa,cDb,cD_aIb),cDb)
| member(g(cDa,cDb,cD_aIb),b) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_38,hypothesis,
( member(X1,b)
| ~ member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,hypothesis,
( member(g(cDa,cDb,cD_aIb),aIb)
| ~ member(g(cDa,cDb,cD_aIb),cDa) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_16]) ).
cnf(c_0_40,hypothesis,
( member(g(cDa,cDb,cD_aIb),cDa)
| member(g(cDa,cDb,cD_aIb),a) ),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_41,hypothesis,
( member(X1,a)
| ~ member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_42,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ difference(X4,X2,X3) ),
not_member_of_difference ).
cnf(c_0_43,hypothesis,
( member(X1,aIb)
| ~ member(X1,b)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_44,hypothesis,
member(g(cDa,cDb,cD_aIb),b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,hypothesis,
member(g(cDa,cDb,cD_aIb),a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,hypothesis,
( ~ member(X1,cD_aIb)
| ~ member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_47,hypothesis,
member(g(cDa,cDb,cD_aIb),aIb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_48,hypothesis,
( ~ member(X1,cDb)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_49,hypothesis,
( member(g(cDa,cDb,cD_aIb),cDb)
| member(g(cDa,cDb,cD_aIb),cDa) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_22]),c_0_47])]) ).
cnf(c_0_50,hypothesis,
( ~ member(X1,cDa)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_51,hypothesis,
member(g(cDa,cDb,cD_aIb),cDa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44])]) ).
cnf(c_0_52,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 17:15:03 EDT 2023
% 0.12/0.32 % 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.eMm4S2i0LO/E---3.1_15507.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15586 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHNF-FFMS32-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 811s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 136s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46 # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 15591 completed with status 0
% 0.17/0.46 # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHNF-FFMS32-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 811s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 29
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 29
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 29
% 0.17/0.46 # Processed clauses : 199
% 0.17/0.46 # ...of these trivial : 11
% 0.17/0.46 # ...subsumed : 1
% 0.17/0.46 # ...remaining for further processing : 187
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 3
% 0.17/0.46 # Backward-rewritten : 20
% 0.17/0.46 # Generated clauses : 1058
% 0.17/0.46 # ...of the previous two non-redundant : 956
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 4
% 0.17/0.46 # Paramodulations : 1058
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 147
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 135
% 0.17/0.46 # Positive orientable unit clauses : 32
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 102
% 0.17/0.46 # Current number of unprocessed clauses: 784
% 0.17/0.46 # ...number of literals in the above : 3135
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 52
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 3343
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 2002
% 0.17/0.46 # Non-unit clause-clause subsumptions : 7
% 0.17/0.46 # Unit Clause-clause subsumption calls : 1031
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 9
% 0.17/0.46 # BW rewrite match successes : 9
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 18976
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.018 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.021 s
% 0.17/0.46 # Maximum resident set size: 1652 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.092 s
% 0.17/0.46 # System time : 0.010 s
% 0.17/0.46 # Total time : 0.102 s
% 0.17/0.46 # Maximum resident set size: 1696 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------