TSTP Solution File: NUM172-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM172-1 : TPTP v8.1.2. Bugfixed v2.1.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 18:58:25 EDT 2023
% Result : Unsatisfiable 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of clauses : 58 ( 23 unt; 16 nHn; 32 RR)
% Number of literals : 103 ( 41 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',intersection1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',complement1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',intersection2) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',restriction1) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',successor) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',complement2) ).
cnf(prove_successor_is_different_1,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',prove_successor_is_different_1) ).
cnf(prove_successor_is_different_2,negated_conjecture,
successor(x) = x,
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',prove_successor_is_different_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',union) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',unordered_pair_member) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',regularity2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.mmCy8wPljV/E---3.1_4991.p',unordered_pair2) ).
cnf(c_0_16,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_17,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_18,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_19,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_21,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(regular(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_23,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_24,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_25,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_26,plain,
intersection(complement(X1),X1) = null_class,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
( member(X1,X2)
| ~ member(X1,null_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_29,plain,
~ member(X1,domain_of(complement(cross_product(unordered_pair(X1,X1),universal_class)))),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_30,plain,
( intersection(null_class,X1) = null_class
| member(regular(intersection(null_class,X1)),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_31,plain,
intersection(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_33,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_34,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_35,negated_conjecture,
member(x,universal_class),
prove_successor_is_different_1 ).
cnf(c_0_36,negated_conjecture,
successor(x) = x,
prove_successor_is_different_2 ).
cnf(c_0_37,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_38,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_39,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_33,c_0_17]) ).
cnf(c_0_40,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_41,negated_conjecture,
( member(x,complement(X1))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
complement(intersection(complement(x),complement(unordered_pair(x,x)))) = x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_43,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_44,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_45,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_46,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( member(x,intersection(complement(x),complement(unordered_pair(x,x))))
| member(x,x) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_46])]) ).
cnf(c_0_50,negated_conjecture,
( member(x,complement(unordered_pair(x,x)))
| member(x,x) ),
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_51,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_53,negated_conjecture,
( member(x,x)
| ~ member(x,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_18,c_0_50]) ).
cnf(c_0_54,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,universal_class)
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
member(x,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_35])]) ).
cnf(c_0_56,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_35]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_56]),c_0_35])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : NUM172-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 14:19:14 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.46 Running first-order model finding
% 0.23/0.46 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.mmCy8wPljV/E---3.1_4991.p
% 0.23/0.57 # Version: 3.1pre001
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 # Starting sh5l with 300s (1) cores
% 0.23/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5108 completed with status 0
% 0.23/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # No SInE strategy applied
% 0.23/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57 # Starting new_bool_1 with 308s (1) cores
% 0.23/0.57 # Starting sh5l with 304s (1) cores
% 0.23/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.57 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5134 completed with status 0
% 0.23/0.57 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 # No SInE strategy applied
% 0.23/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.23/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57 # Starting new_bool_1 with 308s (1) cores
% 0.23/0.57 # Starting sh5l with 304s (1) cores
% 0.23/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.57 # Preprocessing time : 0.002 s
% 0.23/0.57 # Presaturation interreduction done
% 0.23/0.57
% 0.23/0.57 # Proof found!
% 0.23/0.57 # SZS status Unsatisfiable
% 0.23/0.57 # SZS output start CNFRefutation
% See solution above
% 0.23/0.57 # Parsed axioms : 160
% 0.23/0.57 # Removed by relevancy pruning/SinE : 0
% 0.23/0.57 # Initial clauses : 160
% 0.23/0.57 # Removed in clause preprocessing : 19
% 0.23/0.57 # Initial clauses in saturation : 141
% 0.23/0.57 # Processed clauses : 1330
% 0.23/0.57 # ...of these trivial : 6
% 0.23/0.57 # ...subsumed : 382
% 0.23/0.57 # ...remaining for further processing : 942
% 0.23/0.57 # Other redundant clauses eliminated : 10
% 0.23/0.57 # Clauses deleted for lack of memory : 0
% 0.23/0.57 # Backward-subsumed : 82
% 0.23/0.57 # Backward-rewritten : 150
% 0.23/0.57 # Generated clauses : 3583
% 0.23/0.57 # ...of the previous two non-redundant : 3020
% 0.23/0.57 # ...aggressively subsumed : 0
% 0.23/0.57 # Contextual simplify-reflections : 18
% 0.23/0.57 # Paramodulations : 3567
% 0.23/0.57 # Factorizations : 6
% 0.23/0.57 # NegExts : 0
% 0.23/0.57 # Equation resolutions : 10
% 0.23/0.57 # Total rewrite steps : 1076
% 0.23/0.57 # Propositional unsat checks : 0
% 0.23/0.57 # Propositional check models : 0
% 0.23/0.57 # Propositional check unsatisfiable : 0
% 0.23/0.57 # Propositional clauses : 0
% 0.23/0.57 # Propositional clauses after purity: 0
% 0.23/0.57 # Propositional unsat core size : 0
% 0.23/0.57 # Propositional preprocessing time : 0.000
% 0.23/0.57 # Propositional encoding time : 0.000
% 0.23/0.57 # Propositional solver time : 0.000
% 0.23/0.57 # Success case prop preproc time : 0.000
% 0.23/0.57 # Success case prop encoding time : 0.000
% 0.23/0.57 # Success case prop solver time : 0.000
% 0.23/0.57 # Current number of processed clauses : 564
% 0.23/0.57 # Positive orientable unit clauses : 69
% 0.23/0.57 # Positive unorientable unit clauses: 3
% 0.23/0.57 # Negative unit clauses : 6
% 0.23/0.57 # Non-unit-clauses : 486
% 0.23/0.57 # Current number of unprocessed clauses: 1720
% 0.23/0.57 # ...number of literals in the above : 5046
% 0.23/0.57 # Current number of archived formulas : 0
% 0.23/0.57 # Current number of archived clauses : 391
% 0.23/0.57 # Clause-clause subsumption calls (NU) : 50547
% 0.23/0.57 # Rec. Clause-clause subsumption calls : 29520
% 0.23/0.57 # Non-unit clause-clause subsumptions : 383
% 0.23/0.57 # Unit Clause-clause subsumption calls : 2054
% 0.23/0.57 # Rewrite failures with RHS unbound : 0
% 0.23/0.57 # BW rewrite match attempts : 68
% 0.23/0.57 # BW rewrite match successes : 22
% 0.23/0.57 # Condensation attempts : 0
% 0.23/0.57 # Condensation successes : 0
% 0.23/0.57 # Termbank termtop insertions : 87694
% 0.23/0.57
% 0.23/0.57 # -------------------------------------------------
% 0.23/0.57 # User time : 0.093 s
% 0.23/0.57 # System time : 0.005 s
% 0.23/0.57 # Total time : 0.098 s
% 0.23/0.57 # Maximum resident set size: 2216 pages
% 0.23/0.57
% 0.23/0.57 # -------------------------------------------------
% 0.23/0.57 # User time : 0.466 s
% 0.23/0.57 # System time : 0.015 s
% 0.23/0.57 # Total time : 0.482 s
% 0.23/0.57 # Maximum resident set size: 1812 pages
% 0.23/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------