TSTP Solution File: SET382-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET382-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:58:22 EDT 2024
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 15 unt; 4 nHn; 27 RR)
% Number of literals : 69 ( 13 equ; 33 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 69 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_corollary_1_to_relation_property2_1,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_relation_property2_1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_corollary_1_to_relation_property2_2,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_relation_property2_2) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
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,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_12,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
prove_corollary_1_to_relation_property2_1 ).
cnf(c_0_15,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_11 ).
cnf(c_0_16,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
( member(X1,cross_product(universal_class,universal_class))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
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,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_20,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_relation_property2_2]) ).
cnf(c_0_21,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( member(not_subclass_element(x,X1),cross_product(universal_class,universal_class))
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_24,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_25,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
c_0_20 ).
cnf(c_0_27,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_28,negated_conjecture,
( subclass(x,intersection(X1,cross_product(universal_class,universal_class)))
| ~ member(not_subclass_element(x,intersection(X1,cross_product(universal_class,universal_class))),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
intersection(x,cross_product(universal_class,universal_class)) != x,
inference(rw,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
subclass(x,intersection(cross_product(universal_class,universal_class),x)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]) ).
cnf(c_0_34,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
intersection(cross_product(universal_class,universal_class),x) != x,
inference(rw,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SET382-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.04/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 13:17:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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/benchmark/theBenchmark.p
% 0.14/0.44 # Version: 3.1.0
% 0.14/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23527 completed with status 0
% 0.14/0.44 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 # No SInE strategy applied
% 0.14/0.44 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.14/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 308s (1) cores
% 0.14/0.44 # Starting sh5l with 304s (1) cores
% 0.14/0.44 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.44 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23535 completed with status 0
% 0.14/0.44 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 # No SInE strategy applied
% 0.14/0.44 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.14/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.44 # Preprocessing time : 0.002 s
% 0.14/0.44 # Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 # Proof found!
% 0.14/0.44 # SZS status Unsatisfiable
% 0.14/0.44 # SZS output start CNFRefutation
% See solution above
% 0.14/0.44 # Parsed axioms : 114
% 0.14/0.44 # Removed by relevancy pruning/SinE : 0
% 0.14/0.44 # Initial clauses : 114
% 0.14/0.44 # Removed in clause preprocessing : 17
% 0.14/0.44 # Initial clauses in saturation : 97
% 0.14/0.44 # Processed clauses : 522
% 0.14/0.44 # ...of these trivial : 3
% 0.14/0.44 # ...subsumed : 126
% 0.14/0.44 # ...remaining for further processing : 393
% 0.14/0.44 # Other redundant clauses eliminated : 6
% 0.14/0.44 # Clauses deleted for lack of memory : 0
% 0.14/0.44 # Backward-subsumed : 14
% 0.14/0.44 # Backward-rewritten : 39
% 0.14/0.44 # Generated clauses : 982
% 0.14/0.44 # ...of the previous two non-redundant : 914
% 0.14/0.44 # ...aggressively subsumed : 0
% 0.14/0.44 # Contextual simplify-reflections : 4
% 0.14/0.44 # Paramodulations : 974
% 0.14/0.44 # Factorizations : 2
% 0.14/0.44 # NegExts : 0
% 0.14/0.44 # Equation resolutions : 6
% 0.14/0.44 # Disequality decompositions : 0
% 0.14/0.44 # Total rewrite steps : 178
% 0.14/0.44 # ...of those cached : 132
% 0.14/0.44 # Propositional unsat checks : 0
% 0.14/0.44 # Propositional check models : 0
% 0.14/0.44 # Propositional check unsatisfiable : 0
% 0.14/0.44 # Propositional clauses : 0
% 0.14/0.44 # Propositional clauses after purity: 0
% 0.14/0.44 # Propositional unsat core size : 0
% 0.14/0.44 # Propositional preprocessing time : 0.000
% 0.14/0.44 # Propositional encoding time : 0.000
% 0.14/0.44 # Propositional solver time : 0.000
% 0.14/0.44 # Success case prop preproc time : 0.000
% 0.14/0.44 # Success case prop encoding time : 0.000
% 0.14/0.44 # Success case prop solver time : 0.000
% 0.14/0.44 # Current number of processed clauses : 240
% 0.14/0.44 # Positive orientable unit clauses : 40
% 0.14/0.44 # Positive unorientable unit clauses: 1
% 0.14/0.44 # Negative unit clauses : 3
% 0.14/0.44 # Non-unit-clauses : 196
% 0.14/0.44 # Current number of unprocessed clauses: 555
% 0.14/0.44 # ...number of literals in the above : 1636
% 0.14/0.44 # Current number of archived formulas : 0
% 0.14/0.44 # Current number of archived clauses : 166
% 0.14/0.44 # Clause-clause subsumption calls (NU) : 9639
% 0.14/0.44 # Rec. Clause-clause subsumption calls : 5375
% 0.14/0.44 # Non-unit clause-clause subsumptions : 125
% 0.14/0.44 # Unit Clause-clause subsumption calls : 293
% 0.14/0.44 # Rewrite failures with RHS unbound : 0
% 0.14/0.44 # BW rewrite match attempts : 25
% 0.14/0.44 # BW rewrite match successes : 9
% 0.14/0.44 # Condensation attempts : 0
% 0.14/0.44 # Condensation successes : 0
% 0.14/0.44 # Termbank termtop insertions : 32960
% 0.14/0.44 # Search garbage collected termcells : 185
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.042 s
% 0.14/0.44 # System time : 0.006 s
% 0.14/0.44 # Total time : 0.048 s
% 0.14/0.44 # Maximum resident set size: 2008 pages
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.221 s
% 0.14/0.44 # System time : 0.007 s
% 0.14/0.44 # Total time : 0.228 s
% 0.14/0.44 # Maximum resident set size: 1796 pages
% 0.14/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------