TSTP Solution File: SET075-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET075-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:20 EDT 2023
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 17 unt; 5 nHn; 23 RR)
% Number of literals : 62 ( 15 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',singleton_set) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',cartesian_product2) ).
cnf(prove_corollary_to_unordered_pair_axiom3_1,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',prove_corollary_to_unordered_pair_axiom3_1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',intersection1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',regularity2) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',unordered_pair3) ).
cnf(prove_corollary_to_unordered_pair_axiom3_2,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',prove_corollary_to_unordered_pair_axiom3_2) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VfpLABMuLn/E---3.1_12659.p',complement1) ).
cnf(c_0_11,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_12,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_13,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_14,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
prove_corollary_to_unordered_pair_axiom3_1 ).
cnf(c_0_16,plain,
( member(X2,X4)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(u,v)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_19,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_20,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_21,negated_conjecture,
unordered_pair(x,y) = null_class,
prove_corollary_to_unordered_pair_axiom3_2 ).
cnf(c_0_22,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_23,negated_conjecture,
member(y,v),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( member(y,null_class)
| ~ member(y,universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( member(y,X1)
| ~ subclass(v,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_28,negated_conjecture,
( X1 = null_class
| member(y,X1)
| ~ member(y,universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_31,negated_conjecture,
( X1 = null_class
| member(y,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( complement(X1) = null_class
| ~ member(y,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(y,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
member(y,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
~ member(y,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SET075-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 17:38:00 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.VfpLABMuLn/E---3.1_12659.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12737 completed with status 0
% 0.17/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 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_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 308s (1) cores
% 0.17/0.47 # Starting sh5l with 304s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 12744 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 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_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.47 # Preprocessing time : 0.006 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 : 93
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 93
% 0.17/0.47 # Removed in clause preprocessing : 15
% 0.17/0.47 # Initial clauses in saturation : 78
% 0.17/0.47 # Processed clauses : 175
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 6
% 0.17/0.47 # ...remaining for further processing : 169
% 0.17/0.47 # Other redundant clauses eliminated : 3
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 2
% 0.17/0.47 # Backward-rewritten : 8
% 0.17/0.47 # Generated clauses : 144
% 0.17/0.47 # ...of the previous two non-redundant : 128
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 137
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 3
% 0.17/0.47 # Total rewrite steps : 19
% 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 : 75
% 0.17/0.47 # Positive orientable unit clauses : 21
% 0.17/0.47 # Positive unorientable unit clauses: 1
% 0.17/0.47 # Negative unit clauses : 1
% 0.17/0.47 # Non-unit-clauses : 52
% 0.17/0.47 # Current number of unprocessed clauses: 107
% 0.17/0.47 # ...number of literals in the above : 271
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 106
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 1509
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 910
% 0.17/0.47 # Non-unit clause-clause subsumptions : 6
% 0.17/0.47 # Unit Clause-clause subsumption calls : 160
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 8
% 0.17/0.47 # BW rewrite match successes : 6
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 7306
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.011 s
% 0.17/0.47 # System time : 0.006 s
% 0.17/0.47 # Total time : 0.017 s
% 0.17/0.47 # Maximum resident set size: 1944 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.054 s
% 0.17/0.47 # System time : 0.028 s
% 0.17/0.47 # Total time : 0.082 s
% 0.17/0.47 # Maximum resident set size: 1756 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------