TSTP Solution File: SET188-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET188-6 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:57:58 EDT 2024
% Result : Unsatisfiable 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 39 ( 10 unt; 10 nHn; 25 RR)
% Number of literals : 79 ( 7 equ; 36 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_subclass_property6_1,negated_conjecture,
intersection(complement(y),x) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property6_1) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(prove_subclass_property6_2,negated_conjecture,
~ subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property6_2) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_12,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_10 ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_15,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_11 ).
cnf(c_0_16,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_17,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_19,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
intersection(complement(y),x) = null_class,
prove_subclass_property6_1 ).
cnf(c_0_21,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_24,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( member(X1,null_class)
| ~ member(X1,complement(y))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_28,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( member(X1,complement(universal_class))
| ~ member(X1,complement(y))
| ~ member(X1,x) ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_27 ).
cnf(c_0_31,plain,
( member(X1,X2)
| ~ member(X1,complement(universal_class)) ),
inference(spm,[status(thm)],[c_0_12,c_0_28]) ).
cnf(c_0_32,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_33,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ subclass(x,y),
inference(fof_simplification,[status(thm)],[prove_subclass_property6_2]) ).
cnf(c_0_35,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
( member(not_subclass_element(x,X1),y)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
~ subclass(x,y),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET188-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:06:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 # Version: 3.1.0
% 0.19/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.55 # Starting sh5l with 300s (1) cores
% 0.19/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28266 completed with status 0
% 0.19/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.55 # No SInE strategy applied
% 0.19/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.19/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.19/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.55 # Starting new_bool_1 with 308s (1) cores
% 0.19/0.55 # Starting sh5l with 304s (1) cores
% 0.19/0.55 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28274 completed with status 0
% 0.19/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.55 # No SInE strategy applied
% 0.19/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.19/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.19/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.55 # Preprocessing time : 0.004 s
% 0.19/0.55 # Presaturation interreduction done
% 0.19/0.55
% 0.19/0.55 # Proof found!
% 0.19/0.55 # SZS status Unsatisfiable
% 0.19/0.55 # SZS output start CNFRefutation
% See solution above
% 0.19/0.55 # Parsed axioms : 114
% 0.19/0.55 # Removed by relevancy pruning/SinE : 0
% 0.19/0.55 # Initial clauses : 114
% 0.19/0.55 # Removed in clause preprocessing : 17
% 0.19/0.55 # Initial clauses in saturation : 97
% 0.19/0.55 # Processed clauses : 557
% 0.19/0.55 # ...of these trivial : 4
% 0.19/0.55 # ...subsumed : 125
% 0.19/0.55 # ...remaining for further processing : 428
% 0.19/0.55 # Other redundant clauses eliminated : 6
% 0.19/0.55 # Clauses deleted for lack of memory : 0
% 0.19/0.55 # Backward-subsumed : 39
% 0.19/0.55 # Backward-rewritten : 52
% 0.19/0.55 # Generated clauses : 1069
% 0.19/0.55 # ...of the previous two non-redundant : 983
% 0.19/0.55 # ...aggressively subsumed : 0
% 0.19/0.55 # Contextual simplify-reflections : 5
% 0.19/0.55 # Paramodulations : 1061
% 0.19/0.55 # Factorizations : 2
% 0.19/0.55 # NegExts : 0
% 0.19/0.55 # Equation resolutions : 6
% 0.19/0.55 # Disequality decompositions : 0
% 0.19/0.55 # Total rewrite steps : 222
% 0.19/0.55 # ...of those cached : 173
% 0.19/0.55 # Propositional unsat checks : 0
% 0.19/0.55 # Propositional check models : 0
% 0.19/0.55 # Propositional check unsatisfiable : 0
% 0.19/0.55 # Propositional clauses : 0
% 0.19/0.55 # Propositional clauses after purity: 0
% 0.19/0.55 # Propositional unsat core size : 0
% 0.19/0.55 # Propositional preprocessing time : 0.000
% 0.19/0.55 # Propositional encoding time : 0.000
% 0.19/0.55 # Propositional solver time : 0.000
% 0.19/0.55 # Success case prop preproc time : 0.000
% 0.19/0.55 # Success case prop encoding time : 0.000
% 0.19/0.55 # Success case prop solver time : 0.000
% 0.19/0.55 # Current number of processed clauses : 237
% 0.19/0.55 # Positive orientable unit clauses : 43
% 0.19/0.55 # Positive unorientable unit clauses: 1
% 0.19/0.55 # Negative unit clauses : 3
% 0.19/0.55 # Non-unit-clauses : 190
% 0.19/0.55 # Current number of unprocessed clauses: 592
% 0.19/0.55 # ...number of literals in the above : 1773
% 0.19/0.55 # Current number of archived formulas : 0
% 0.19/0.55 # Current number of archived clauses : 204
% 0.19/0.55 # Clause-clause subsumption calls (NU) : 11191
% 0.19/0.55 # Rec. Clause-clause subsumption calls : 6089
% 0.19/0.55 # Non-unit clause-clause subsumptions : 132
% 0.19/0.55 # Unit Clause-clause subsumption calls : 426
% 0.19/0.55 # Rewrite failures with RHS unbound : 0
% 0.19/0.55 # BW rewrite match attempts : 15
% 0.19/0.55 # BW rewrite match successes : 8
% 0.19/0.55 # Condensation attempts : 0
% 0.19/0.55 # Condensation successes : 0
% 0.19/0.55 # Termbank termtop insertions : 33733
% 0.19/0.55 # Search garbage collected termcells : 185
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.060 s
% 0.19/0.55 # System time : 0.006 s
% 0.19/0.55 # Total time : 0.066 s
% 0.19/0.55 # Maximum resident set size: 2020 pages
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.294 s
% 0.19/0.55 # System time : 0.023 s
% 0.19/0.55 # Total time : 0.318 s
% 0.19/0.55 # Maximum resident set size: 1800 pages
% 0.19/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------