TSTP Solution File: SET134-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET134-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:18:37 EDT 2023
% Result : Unsatisfiable 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 15 unt; 9 nHn; 17 RR)
% Number of literals : 55 ( 17 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',singleton_set) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',complement2) ).
cnf(prove_corollary_2_to_member_of_triple_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',prove_corollary_2_to_member_of_triple_1) ).
cnf(prove_corollary_2_to_member_of_triple_2,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',prove_corollary_2_to_member_of_triple_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',union) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',complement1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',regularity2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.FokurLGQo3/E---3.1_29531.p',unordered_pair2) ).
cnf(c_0_10,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_13,negated_conjecture,
member(u,universal_class),
prove_corollary_2_to_member_of_triple_1 ).
cnf(c_0_14,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
prove_corollary_2_to_member_of_triple_2 ).
cnf(c_0_15,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_17,negated_conjecture,
( member(u,complement(X1))
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) = null_class,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_19,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_20,negated_conjecture,
( member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))
| member(u,null_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_22,negated_conjecture,
( member(u,complement(unordered_pair(u,u)))
| member(u,null_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_24,negated_conjecture,
( member(u,null_class)
| ~ member(u,unordered_pair(u,u)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_26,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
member(u,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
( X1 = null_class
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( complement(X1) = null_class
| ~ member(u,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(u,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
~ member(u,X1),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_31]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SET134-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n004.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 2400
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon Oct 2 17:20:45 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.FokurLGQo3/E---3.1_29531.p
% 0.13/0.46 # Version: 3.1pre001
% 0.13/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.46 # Starting sh5l with 300s (1) cores
% 0.13/0.46 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29693 completed with status 0
% 0.13/0.46 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 # No SInE strategy applied
% 0.13/0.46 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.13/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.46 # Starting new_bool_1 with 308s (1) cores
% 0.13/0.46 # Starting sh5l with 304s (1) cores
% 0.13/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29707 completed with status 0
% 0.13/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 # No SInE strategy applied
% 0.13/0.46 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.13/0.46 # Preprocessing time : 0.004 s
% 0.13/0.46 # Presaturation interreduction done
% 0.13/0.46
% 0.13/0.46 # Proof found!
% 0.13/0.46 # SZS status Unsatisfiable
% 0.13/0.46 # SZS output start CNFRefutation
% See solution above
% 0.13/0.46 # Parsed axioms : 94
% 0.13/0.46 # Removed by relevancy pruning/SinE : 0
% 0.13/0.46 # Initial clauses : 94
% 0.13/0.46 # Removed in clause preprocessing : 16
% 0.13/0.46 # Initial clauses in saturation : 78
% 0.13/0.46 # Processed clauses : 152
% 0.13/0.46 # ...of these trivial : 0
% 0.13/0.46 # ...subsumed : 0
% 0.13/0.46 # ...remaining for further processing : 152
% 0.13/0.46 # Other redundant clauses eliminated : 3
% 0.13/0.46 # Clauses deleted for lack of memory : 0
% 0.13/0.46 # Backward-subsumed : 6
% 0.13/0.46 # Backward-rewritten : 3
% 0.13/0.46 # Generated clauses : 144
% 0.13/0.46 # ...of the previous two non-redundant : 124
% 0.13/0.46 # ...aggressively subsumed : 0
% 0.13/0.46 # Contextual simplify-reflections : 0
% 0.13/0.46 # Paramodulations : 136
% 0.13/0.46 # Factorizations : 0
% 0.13/0.46 # NegExts : 0
% 0.13/0.46 # Equation resolutions : 3
% 0.13/0.46 # Total rewrite steps : 20
% 0.13/0.46 # Propositional unsat checks : 0
% 0.13/0.46 # Propositional check models : 0
% 0.13/0.46 # Propositional check unsatisfiable : 0
% 0.13/0.46 # Propositional clauses : 0
% 0.13/0.46 # Propositional clauses after purity: 0
% 0.13/0.46 # Propositional unsat core size : 0
% 0.13/0.46 # Propositional preprocessing time : 0.000
% 0.13/0.46 # Propositional encoding time : 0.000
% 0.13/0.46 # Propositional solver time : 0.000
% 0.13/0.46 # Success case prop preproc time : 0.000
% 0.13/0.46 # Success case prop encoding time : 0.000
% 0.13/0.46 # Success case prop solver time : 0.000
% 0.13/0.46 # Current number of processed clauses : 58
% 0.13/0.46 # Positive orientable unit clauses : 16
% 0.13/0.46 # Positive unorientable unit clauses: 0
% 0.13/0.46 # Negative unit clauses : 1
% 0.13/0.46 # Non-unit-clauses : 41
% 0.13/0.46 # Current number of unprocessed clauses: 126
% 0.13/0.46 # ...number of literals in the above : 327
% 0.13/0.46 # Current number of archived formulas : 0
% 0.13/0.46 # Current number of archived clauses : 107
% 0.13/0.46 # Clause-clause subsumption calls (NU) : 1777
% 0.13/0.46 # Rec. Clause-clause subsumption calls : 773
% 0.13/0.46 # Non-unit clause-clause subsumptions : 0
% 0.13/0.46 # Unit Clause-clause subsumption calls : 91
% 0.13/0.46 # Rewrite failures with RHS unbound : 0
% 0.13/0.46 # BW rewrite match attempts : 6
% 0.13/0.46 # BW rewrite match successes : 2
% 0.13/0.46 # Condensation attempts : 0
% 0.13/0.46 # Condensation successes : 0
% 0.13/0.46 # Termbank termtop insertions : 7754
% 0.13/0.46
% 0.13/0.46 # -------------------------------------------------
% 0.13/0.46 # User time : 0.017 s
% 0.13/0.46 # System time : 0.006 s
% 0.13/0.46 # Total time : 0.023 s
% 0.13/0.46 # Maximum resident set size: 1944 pages
% 0.13/0.46
% 0.13/0.46 # -------------------------------------------------
% 0.13/0.46 # User time : 0.077 s
% 0.13/0.46 # System time : 0.024 s
% 0.13/0.46 # Total time : 0.101 s
% 0.13/0.46 # Maximum resident set size: 1756 pages
% 0.13/0.46 % E---3.1 exiting
% 0.13/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------