TSTP Solution File: SET061-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET061-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 09:17:40 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 16 ( 4 unt; 4 nHn; 12 RR)
% Number of literals : 30 ( 7 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.zTtBDxUlM0/E---3.1_19568.p',intersection1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.zTtBDxUlM0/E---3.1_19568.p',regularity2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zTtBDxUlM0/E---3.1_19568.p',complement1) ).
cnf(prove_existence_of_null_class_1,negated_conjecture,
member(z,null_class),
file('/export/starexec/sandbox/tmp/tmp.zTtBDxUlM0/E---3.1_19568.p',prove_existence_of_null_class_1) ).
cnf(c_0_4,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_5,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_4 ).
cnf(c_0_6,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_7,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_8,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
member(z,null_class),
prove_existence_of_null_class_1 ).
cnf(c_0_10,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( X1 = null_class
| member(z,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( complement(X1) = null_class
| ~ member(z,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(z,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
~ member(z,X1),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET061-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 10:17:49 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.zTtBDxUlM0/E---3.1_19568.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19672 completed with status 0
% 0.21/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 308s (1) cores
% 0.21/0.52 # Starting sh5l with 304s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19680 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.52 # Preprocessing time : 0.003 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 92
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 92
% 0.21/0.52 # Removed in clause preprocessing : 15
% 0.21/0.52 # Initial clauses in saturation : 77
% 0.21/0.52 # Processed clauses : 118
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 118
% 0.21/0.52 # Other redundant clauses eliminated : 3
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 2
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 30
% 0.21/0.52 # ...of the previous two non-redundant : 25
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 25
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 3
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 2
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 35
% 0.21/0.52 # Positive orientable unit clauses : 11
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 23
% 0.21/0.52 # Current number of unprocessed clauses: 59
% 0.21/0.52 # ...number of literals in the above : 140
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 95
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 1237
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 559
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 12
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 4
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 6186
% 0.21/0.52 # Search garbage collected termcells : 154
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1928 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.059 s
% 0.21/0.52 # System time : 0.019 s
% 0.21/0.52 # Total time : 0.077 s
% 0.21/0.52 # Maximum resident set size: 1772 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------