TSTP Solution File: SET009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:21:31 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 11 unt; 7 nHn; 26 RR)
% Number of literals : 61 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(member_of_difference,axiom,
( member(X4,X1)
| ~ difference(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',member_of_difference) ).
cnf(b_minus_a,hypothesis,
difference(b,a,bDa),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',b_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/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',member_of_difference_or_set2) ).
cnf(b_minus_d,hypothesis,
difference(b,d,bDd),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',b_minus_d) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',subsets_axiom1) ).
cnf(not_member_of_difference,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ difference(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',not_member_of_difference) ).
cnf(membership_in_subsets,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',membership_in_subsets) ).
cnf(d_is_a_subset_of_a,hypothesis,
subset(d,a),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',d_is_a_subset_of_a) ).
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',subsets_axiom2) ).
cnf(prove_bDa_is_a_subset_of_bDd,negated_conjecture,
~ subset(bDa,bDd),
file('/export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p',prove_bDa_is_a_subset_of_bDd) ).
cnf(c_0_10,axiom,
( member(X4,X1)
| ~ difference(X1,X2,X3)
| ~ member(X4,X3) ),
member_of_difference ).
cnf(c_0_11,hypothesis,
difference(b,a,bDa),
b_minus_a ).
cnf(c_0_12,axiom,
( member(X1,X4)
| member(X1,X3)
| ~ member(X1,X2)
| ~ difference(X2,X3,X4) ),
member_of_difference_or_set2 ).
cnf(c_0_13,hypothesis,
difference(b,d,bDd),
b_minus_d ).
cnf(c_0_14,hypothesis,
( member(X1,b)
| ~ member(X1,bDa) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
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,d)
| member(X1,bDd)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
( subset(bDa,X1)
| member(member_of_1_not_of_2(bDa,X1),b) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ difference(X4,X2,X3) ),
not_member_of_difference ).
cnf(c_0_19,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
membership_in_subsets ).
cnf(c_0_20,hypothesis,
subset(d,a),
d_is_a_subset_of_a ).
cnf(c_0_21,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
subsets_axiom2 ).
cnf(c_0_22,hypothesis,
( subset(bDa,X1)
| member(member_of_1_not_of_2(bDa,X1),bDd)
| member(member_of_1_not_of_2(bDa,X1),d) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ subset(bDa,bDd),
prove_bDa_is_a_subset_of_bDd ).
cnf(c_0_24,hypothesis,
( ~ member(X1,bDa)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,hypothesis,
( member(X1,a)
| ~ member(X1,d) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,hypothesis,
member(member_of_1_not_of_2(bDa,bDd),d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,hypothesis,
( subset(bDa,X1)
| ~ member(member_of_1_not_of_2(bDa,X1),a) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,hypothesis,
member(member_of_1_not_of_2(bDa,bDd),a),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 16:52:44 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.1cyHtdMvER/E---3.1_3350.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3519 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNF-FFSS32-SFFFFFNN
% 0.21/0.51 # partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3526 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNF-FFSS32-SFFFFFNN
% 0.21/0.51 # partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 16
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 16
% 0.21/0.51 # Processed clauses : 84
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 15
% 0.21/0.51 # ...remaining for further processing : 69
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 132
% 0.21/0.51 # ...of the previous two non-redundant : 112
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 1
% 0.21/0.51 # Paramodulations : 126
% 0.21/0.51 # Factorizations : 6
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 2
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 53
% 0.21/0.51 # Positive orientable unit clauses : 12
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 40
% 0.21/0.51 # Current number of unprocessed clauses: 60
% 0.21/0.51 # ...number of literals in the above : 174
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 16
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 284
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 232
% 0.21/0.51 # Non-unit clause-clause subsumptions : 16
% 0.21/0.51 # Unit Clause-clause subsumption calls : 13
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 4
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2163
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1656 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.034 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.040 s
% 0.21/0.51 # Maximum resident set size: 1684 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------