TSTP Solution File: SET101-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET101-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:12 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 14 unt; 4 nHn; 10 RR)
% Number of literals : 34 ( 13 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_singleton_member_of_ordered_pair_1,negated_conjecture,
~ member(singleton(x),ordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_member_of_ordered_pair_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(singleton_is_null_class,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
cnf(corollary_to_unordered_pair_axiom2,axiom,
( ~ member(X1,universal_class)
| unordered_pair(X2,X1) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_to_unordered_pair_axiom2) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(c_0_7,negated_conjecture,
~ member(singleton(x),ordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_singleton_member_of_ordered_pair_1]) ).
cnf(c_0_8,negated_conjecture,
~ member(singleton(x),ordered_pair(x,y)),
c_0_7 ).
cnf(c_0_9,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_10,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_11,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_12,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
singleton_is_null_class ).
cnf(c_0_13,negated_conjecture,
~ member(unordered_pair(x,x),ordered_pair(x,y)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]) ).
cnf(c_0_15,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_11 ).
cnf(c_0_16,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| unordered_pair(X2,X1) != null_class ),
inference(fof_simplification,[status(thm)],[corollary_to_unordered_pair_axiom2]) ).
cnf(c_0_18,negated_conjecture,
~ member(unordered_pair(x,x),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,unordered_pair(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ member(X1,universal_class)
| unordered_pair(X2,X1) != null_class ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
unordered_pair(unordered_pair(x,x),unordered_pair(x,x)) = null_class,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET101-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.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 : Mon May 20 11:07:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 29839 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.21/0.51 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 29842 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 146
% 0.21/0.51 # Removed by relevancy pruning/SinE : 96
% 0.21/0.51 # Initial clauses : 50
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 50
% 0.21/0.51 # Processed clauses : 155
% 0.21/0.51 # ...of these trivial : 3
% 0.21/0.51 # ...subsumed : 44
% 0.21/0.51 # ...remaining for further processing : 108
% 0.21/0.51 # Other redundant clauses eliminated : 4
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 2
% 0.21/0.51 # Backward-rewritten : 15
% 0.21/0.51 # Generated clauses : 297
% 0.21/0.51 # ...of the previous two non-redundant : 189
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 275
% 0.21/0.51 # Factorizations : 18
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 4
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 123
% 0.21/0.51 # ...of those cached : 75
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 46
% 0.21/0.51 # Positive orientable unit clauses : 13
% 0.21/0.51 # Positive unorientable unit clauses: 1
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 30
% 0.21/0.51 # Current number of unprocessed clauses: 126
% 0.21/0.51 # ...number of literals in the above : 339
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 60
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 278
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 258
% 0.21/0.51 # Non-unit clause-clause subsumptions : 40
% 0.21/0.51 # Unit Clause-clause subsumption calls : 6
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 39
% 0.21/0.51 # BW rewrite match successes : 34
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 5197
% 0.21/0.51 # Search garbage collected termcells : 515
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1884 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.015 s
% 0.21/0.51 # System time : 0.005 s
% 0.21/0.51 # Total time : 0.020 s
% 0.21/0.51 # Maximum resident set size: 1812 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------