TSTP Solution File: SET096-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET096-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:22:06 EDT 2023
% Result : Unsatisfiable 0.16s 0.56s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 15 unt; 9 nHn; 23 RR)
% Number of literals : 55 ( 20 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',subclass_members) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',regularity1) ).
cnf(prove_two_subsets_of_singleton_1,negated_conjecture,
subclass(x,singleton(y)),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',prove_two_subsets_of_singleton_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',unordered_pair_member) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',not_subclass_members1) ).
cnf(prove_two_subsets_of_singleton_2,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',prove_two_subsets_of_singleton_2) ).
cnf(prove_two_subsets_of_singleton_3,negated_conjecture,
singleton(y) != x,
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',prove_two_subsets_of_singleton_3) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',subclass_implies_equal) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.bkp3Euz6PC/E---3.1_9672.p',not_subclass_members2) ).
cnf(c_0_10,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_11,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_12,negated_conjecture,
subclass(x,singleton(y)),
prove_two_subsets_of_singleton_1 ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_15,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_16,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
subclass(x,unordered_pair(y,y)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
x != null_class,
prove_two_subsets_of_singleton_2 ).
cnf(c_0_19,negated_conjecture,
singleton(y) != x,
prove_two_subsets_of_singleton_3 ).
cnf(c_0_20,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
member(regular(x),unordered_pair(y,y)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_23,negated_conjecture,
unordered_pair(y,y) != x,
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_25,plain,
( not_subclass_element(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
regular(x) = y,
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ subclass(unordered_pair(y,y),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]) ).
cnf(c_0_28,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
member(y,x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_18]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET096-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 16:38:06 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.bkp3Euz6PC/E---3.1_9672.p
% 0.16/0.56 # Version: 3.1pre001
% 0.16/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.56 # Starting sh5l with 300s (1) cores
% 0.16/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9749 completed with status 0
% 0.16/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.56 # No SInE strategy applied
% 0.16/0.56 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.56 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.56 # Starting sh5l with 304s (1) cores
% 0.16/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.56 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9760 completed with status 0
% 0.16/0.56 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.56 # No SInE strategy applied
% 0.16/0.56 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.56 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.56 # Starting sh5l with 304s (1) cores
% 0.16/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.56 # Preprocessing time : 0.003 s
% 0.16/0.56 # Presaturation interreduction done
% 0.16/0.56
% 0.16/0.56 # Proof found!
% 0.16/0.56 # SZS status Unsatisfiable
% 0.16/0.56 # SZS output start CNFRefutation
% See solution above
% 0.16/0.56 # Parsed axioms : 94
% 0.16/0.56 # Removed by relevancy pruning/SinE : 0
% 0.16/0.56 # Initial clauses : 94
% 0.16/0.56 # Removed in clause preprocessing : 15
% 0.16/0.56 # Initial clauses in saturation : 79
% 0.16/0.56 # Processed clauses : 1481
% 0.16/0.56 # ...of these trivial : 20
% 0.16/0.56 # ...subsumed : 733
% 0.16/0.56 # ...remaining for further processing : 728
% 0.16/0.56 # Other redundant clauses eliminated : 7
% 0.16/0.56 # Clauses deleted for lack of memory : 0
% 0.16/0.56 # Backward-subsumed : 89
% 0.16/0.56 # Backward-rewritten : 56
% 0.16/0.56 # Generated clauses : 4104
% 0.16/0.56 # ...of the previous two non-redundant : 3292
% 0.16/0.56 # ...aggressively subsumed : 0
% 0.16/0.56 # Contextual simplify-reflections : 13
% 0.16/0.56 # Paramodulations : 4087
% 0.16/0.56 # Factorizations : 10
% 0.16/0.56 # NegExts : 0
% 0.16/0.56 # Equation resolutions : 7
% 0.16/0.56 # Total rewrite steps : 1474
% 0.16/0.56 # Propositional unsat checks : 0
% 0.16/0.56 # Propositional check models : 0
% 0.16/0.56 # Propositional check unsatisfiable : 0
% 0.16/0.56 # Propositional clauses : 0
% 0.16/0.56 # Propositional clauses after purity: 0
% 0.16/0.56 # Propositional unsat core size : 0
% 0.16/0.56 # Propositional preprocessing time : 0.000
% 0.16/0.56 # Propositional encoding time : 0.000
% 0.16/0.56 # Propositional solver time : 0.000
% 0.16/0.56 # Success case prop preproc time : 0.000
% 0.16/0.56 # Success case prop encoding time : 0.000
% 0.16/0.56 # Success case prop solver time : 0.000
% 0.16/0.56 # Current number of processed clauses : 502
% 0.16/0.56 # Positive orientable unit clauses : 64
% 0.16/0.56 # Positive unorientable unit clauses: 1
% 0.16/0.56 # Negative unit clauses : 18
% 0.16/0.56 # Non-unit-clauses : 419
% 0.16/0.56 # Current number of unprocessed clauses: 1863
% 0.16/0.56 # ...number of literals in the above : 6187
% 0.16/0.56 # Current number of archived formulas : 0
% 0.16/0.56 # Current number of archived clauses : 238
% 0.16/0.56 # Clause-clause subsumption calls (NU) : 55385
% 0.16/0.56 # Rec. Clause-clause subsumption calls : 26180
% 0.16/0.56 # Non-unit clause-clause subsumptions : 647
% 0.16/0.56 # Unit Clause-clause subsumption calls : 2231
% 0.16/0.56 # Rewrite failures with RHS unbound : 0
% 0.16/0.56 # BW rewrite match attempts : 45
% 0.16/0.56 # BW rewrite match successes : 19
% 0.16/0.56 # Condensation attempts : 0
% 0.16/0.56 # Condensation successes : 0
% 0.16/0.56 # Termbank termtop insertions : 96055
% 0.16/0.56
% 0.16/0.56 # -------------------------------------------------
% 0.16/0.56 # User time : 0.123 s
% 0.16/0.56 # System time : 0.006 s
% 0.16/0.56 # Total time : 0.129 s
% 0.16/0.56 # Maximum resident set size: 1940 pages
% 0.16/0.56
% 0.16/0.56 # -------------------------------------------------
% 0.16/0.56 # User time : 0.616 s
% 0.16/0.56 # System time : 0.023 s
% 0.16/0.56 # Total time : 0.639 s
% 0.16/0.56 # Maximum resident set size: 1756 pages
% 0.16/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------