TSTP Solution File: SET059-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET059-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:52:48 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 25 ( 6 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_equality4_1,negated_conjecture,
member(not_subclass_element(x,y),y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_1) ).
cnf(prove_equality4_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_3) ).
cnf(prove_equality4_2,negated_conjecture,
member(not_subclass_element(y,x),x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_2) ).
cnf(c_0_5,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_6,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
member(not_subclass_element(x,y),y),
prove_equality4_1 ).
cnf(c_0_9,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_equality4_3]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_6 ).
cnf(c_0_11,negated_conjecture,
subclass(x,y),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
x != y,
c_0_9 ).
cnf(c_0_13,negated_conjecture,
member(not_subclass_element(y,x),x),
prove_equality4_2 ).
cnf(c_0_14,negated_conjecture,
~ subclass(y,x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET059-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.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 11:06:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 26796 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 26799 completed with status 0
% 0.20/0.50 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 100
% 0.20/0.50 # Removed by relevancy pruning/SinE : 86
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 14
% 0.20/0.50 # Processed clauses : 29
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 28
% 0.20/0.50 # Other redundant clauses eliminated : 2
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 13
% 0.20/0.50 # ...of the previous two non-redundant : 8
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 11
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 2
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # ...of those cached : 2
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 14
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 7
% 0.20/0.50 # Current number of unprocessed clauses: 5
% 0.20/0.50 # ...number of literals in the above : 11
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 12
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 8
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 8
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1159
% 0.20/0.50 # Search garbage collected termcells : 428
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1748 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1788 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------