TSTP Solution File: SET068-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET068-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:55 EDT 2024
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 11 unt; 9 nHn; 18 RR)
% Number of literals : 58 ( 11 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 51 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
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(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_singleton_in_unordered_pair2_1,negated_conjecture,
~ subclass(singleton(y),unordered_pair(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair2_1) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(c_0_8,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_8 ).
cnf(c_0_10,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_11,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_12,negated_conjecture,
~ subclass(singleton(y),unordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair2_1]) ).
cnf(c_0_13,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_14,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_11 ).
cnf(c_0_16,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_17,negated_conjecture,
~ subclass(singleton(y),unordered_pair(x,y)),
c_0_12 ).
cnf(c_0_18,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_19,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_13 ).
cnf(c_0_20,plain,
( not_subclass_element(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_14])]) ).
cnf(c_0_21,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ subclass(unordered_pair(y,y),unordered_pair(x,y)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_25,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ member(y,unordered_pair(x,y)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
c_0_24 ).
cnf(c_0_28,plain,
( member(X1,universal_class)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
~ member(y,universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET068-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 12:06:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10096 completed with status 0
% 0.18/0.51 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 308s (1) cores
% 0.18/0.51 # Starting sh5l with 304s (1) cores
% 0.18/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.51 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10104 completed with status 0
% 0.18/0.51 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.51 # Preprocessing time : 0.002 s
% 0.18/0.51 # Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Unsatisfiable
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 92
% 0.18/0.51 # Removed by relevancy pruning/SinE : 0
% 0.18/0.51 # Initial clauses : 92
% 0.18/0.51 # Removed in clause preprocessing : 15
% 0.18/0.51 # Initial clauses in saturation : 77
% 0.18/0.51 # Processed clauses : 507
% 0.18/0.51 # ...of these trivial : 7
% 0.18/0.51 # ...subsumed : 163
% 0.18/0.51 # ...remaining for further processing : 337
% 0.18/0.51 # Other redundant clauses eliminated : 5
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 5
% 0.18/0.51 # Backward-rewritten : 25
% 0.18/0.51 # Generated clauses : 1056
% 0.18/0.51 # ...of the previous two non-redundant : 927
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 6
% 0.18/0.51 # Paramodulations : 1049
% 0.18/0.51 # Factorizations : 2
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 5
% 0.18/0.51 # Disequality decompositions : 0
% 0.18/0.51 # Total rewrite steps : 247
% 0.18/0.51 # ...of those cached : 185
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 228
% 0.18/0.51 # Positive orientable unit clauses : 36
% 0.18/0.51 # Positive unorientable unit clauses: 1
% 0.18/0.51 # Negative unit clauses : 5
% 0.18/0.51 # Non-unit-clauses : 186
% 0.18/0.51 # Current number of unprocessed clauses: 522
% 0.18/0.51 # ...number of literals in the above : 1547
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 121
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 7160
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 4374
% 0.18/0.51 # Non-unit clause-clause subsumptions : 142
% 0.18/0.51 # Unit Clause-clause subsumption calls : 531
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 57
% 0.18/0.51 # BW rewrite match successes : 13
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 30444
% 0.18/0.51 # Search garbage collected termcells : 156
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.045 s
% 0.18/0.51 # System time : 0.007 s
% 0.18/0.51 # Total time : 0.052 s
% 0.18/0.51 # Maximum resident set size: 1928 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.233 s
% 0.18/0.51 # System time : 0.015 s
% 0.18/0.51 # Total time : 0.247 s
% 0.18/0.51 # Maximum resident set size: 1780 pages
% 0.18/0.51 % E---3.1 exiting
% 0.18/0.52 % E exiting
%------------------------------------------------------------------------------