TSTP Solution File: SET187-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET187-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:53:34 EDT 2024
% Result : Unsatisfiable 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 6 unt; 5 nHn; 20 RR)
% Number of literals : 47 ( 9 equ; 23 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; 3 con; 0-2 aty)
% Number of variables : 43 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_subclass_property5_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property5_1) ).
cnf(prove_subclass_property5_2,negated_conjecture,
intersection(complement(y),x) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property5_2) ).
cnf(c_0_7,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_10,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_7 ).
cnf(c_0_12,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
subclass(x,y),
prove_subclass_property5_1 ).
cnf(c_0_15,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_9 ).
cnf(c_0_16,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_10 ).
cnf(c_0_17,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
intersection(complement(y),x) != null_class,
inference(fof_simplification,[status(thm)],[prove_subclass_property5_2]) ).
cnf(c_0_21,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(regular(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( intersection(X1,x) = null_class
| member(regular(intersection(X1,x)),y) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
intersection(complement(y),x) != null_class,
c_0_20 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET187-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n003.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon May 20 11:25:22 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.10/0.39 # Version: 3.1.0
% 0.10/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.39 # Starting sh5l with 300s (1) cores
% 0.10/0.39 # sh5l with pid 8641 completed with status 0
% 0.10/0.39 # Result found by sh5l
% 0.10/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.39 # Starting sh5l with 300s (1) cores
% 0.10/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.39 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.39 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.39 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.10/0.39 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 8644 completed with status 0
% 0.10/0.39 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.10/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.39 # Starting sh5l with 300s (1) cores
% 0.10/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.39 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.10/0.39 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.39 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.10/0.39 # Preprocessing time : 0.002 s
% 0.10/0.39 # Presaturation interreduction done
% 0.10/0.39
% 0.10/0.39 # Proof found!
% 0.10/0.39 # SZS status Unsatisfiable
% 0.10/0.39 # SZS output start CNFRefutation
% See solution above
% 0.10/0.39 # Parsed axioms : 114
% 0.10/0.39 # Removed by relevancy pruning/SinE : 14
% 0.10/0.39 # Initial clauses : 100
% 0.10/0.39 # Removed in clause preprocessing : 0
% 0.10/0.39 # Initial clauses in saturation : 100
% 0.10/0.39 # Processed clauses : 835
% 0.10/0.39 # ...of these trivial : 24
% 0.10/0.39 # ...subsumed : 228
% 0.10/0.39 # ...remaining for further processing : 583
% 0.10/0.39 # Other redundant clauses eliminated : 6
% 0.10/0.39 # Clauses deleted for lack of memory : 0
% 0.10/0.39 # Backward-subsumed : 11
% 0.10/0.39 # Backward-rewritten : 12
% 0.10/0.39 # Generated clauses : 3573
% 0.10/0.39 # ...of the previous two non-redundant : 2902
% 0.10/0.39 # ...aggressively subsumed : 0
% 0.10/0.39 # Contextual simplify-reflections : 0
% 0.10/0.39 # Paramodulations : 3560
% 0.10/0.39 # Factorizations : 4
% 0.10/0.39 # NegExts : 0
% 0.10/0.39 # Equation resolutions : 9
% 0.10/0.39 # Disequality decompositions : 0
% 0.10/0.39 # Total rewrite steps : 1204
% 0.10/0.39 # ...of those cached : 961
% 0.10/0.39 # Propositional unsat checks : 0
% 0.10/0.39 # Propositional check models : 0
% 0.10/0.39 # Propositional check unsatisfiable : 0
% 0.10/0.39 # Propositional clauses : 0
% 0.10/0.39 # Propositional clauses after purity: 0
% 0.10/0.39 # Propositional unsat core size : 0
% 0.10/0.39 # Propositional preprocessing time : 0.000
% 0.10/0.39 # Propositional encoding time : 0.000
% 0.10/0.39 # Propositional solver time : 0.000
% 0.10/0.39 # Success case prop preproc time : 0.000
% 0.10/0.39 # Success case prop encoding time : 0.000
% 0.10/0.39 # Success case prop solver time : 0.000
% 0.10/0.39 # Current number of processed clauses : 459
% 0.10/0.39 # Positive orientable unit clauses : 219
% 0.10/0.39 # Positive unorientable unit clauses: 3
% 0.10/0.39 # Negative unit clauses : 2
% 0.10/0.39 # Non-unit-clauses : 235
% 0.10/0.39 # Current number of unprocessed clauses: 2230
% 0.10/0.39 # ...number of literals in the above : 4220
% 0.10/0.39 # Current number of archived formulas : 0
% 0.10/0.39 # Current number of archived clauses : 122
% 0.10/0.39 # Clause-clause subsumption calls (NU) : 8063
% 0.10/0.39 # Rec. Clause-clause subsumption calls : 7064
% 0.10/0.39 # Non-unit clause-clause subsumptions : 148
% 0.10/0.39 # Unit Clause-clause subsumption calls : 4555
% 0.10/0.39 # Rewrite failures with RHS unbound : 18
% 0.10/0.39 # BW rewrite match attempts : 810
% 0.10/0.39 # BW rewrite match successes : 16
% 0.10/0.39 # Condensation attempts : 0
% 0.10/0.39 # Condensation successes : 0
% 0.10/0.39 # Termbank termtop insertions : 52986
% 0.10/0.39 # Search garbage collected termcells : 229
% 0.10/0.39
% 0.10/0.39 # -------------------------------------------------
% 0.10/0.39 # User time : 0.046 s
% 0.10/0.39 # System time : 0.004 s
% 0.10/0.39 # Total time : 0.050 s
% 0.10/0.39 # Maximum resident set size: 2008 pages
% 0.10/0.39
% 0.10/0.39 # -------------------------------------------------
% 0.10/0.39 # User time : 0.048 s
% 0.10/0.39 # System time : 0.005 s
% 0.10/0.39 # Total time : 0.053 s
% 0.10/0.39 # Maximum resident set size: 1796 pages
% 0.10/0.39 % E---3.1 exiting
% 0.10/0.39 % E exiting
%------------------------------------------------------------------------------