TSTP Solution File: TOP001-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : TOP001-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 09:16:17 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 7 unt; 4 nHn; 40 RR)
% Number of literals : 97 ( 0 equ; 52 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(union_of_members_3,axiom,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_3) ).
cnf(topology_generated_38,axiom,
( element_of_collection(f10(X2,X1,X3),X2)
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_38) ).
cnf(topology_generated_37,axiom,
( element_of_set(X3,f10(X2,X1,X3))
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_37) ).
cnf(set_theory_3,axiom,
( subset_sets(X1,X2)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_3) ).
cnf(basis_for_topology_28,axiom,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',basis_for_topology_28) ).
cnf(union_of_members_2,axiom,
( element_of_collection(f1(X2,X1),X2)
| ~ element_of_set(X1,union_of_members(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_2) ).
cnf(union_of_members_1,axiom,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_1) ).
cnf(set_theory_2,axiom,
( element_of_set(X3,X2)
| ~ subset_sets(X1,X2)
| ~ element_of_set(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_2) ).
cnf(lemma_1a_1,negated_conjecture,
basis(cx,f),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1a_1) ).
cnf(set_theory_4,axiom,
( subset_sets(X1,X2)
| element_of_set(in_1st_set(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_4) ).
cnf(set_theory_5,axiom,
( subset_sets(X1,X2)
| ~ element_of_set(in_1st_set(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_5) ).
cnf(lemma_1a_2,negated_conjecture,
~ subset_sets(union_of_members(top_of_basis(f)),cx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1a_2) ).
cnf(c_0_12,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,X2) ),
inference(fof_simplification,[status(thm)],[union_of_members_3]) ).
cnf(c_0_13,plain,
( element_of_collection(f10(X2,X1,X3),X2)
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
inference(fof_simplification,[status(thm)],[topology_generated_38]) ).
cnf(c_0_14,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,X2) ),
c_0_12 ).
cnf(c_0_15,plain,
( element_of_collection(f10(X2,X1,X3),X2)
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
c_0_13 ).
cnf(c_0_16,plain,
( element_of_set(X3,f10(X2,X1,X3))
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
inference(fof_simplification,[status(thm)],[topology_generated_37]) ).
cnf(c_0_17,plain,
( subset_sets(X1,X2)
| ~ equal_sets(X1,X2) ),
inference(fof_simplification,[status(thm)],[set_theory_3]) ).
cnf(c_0_18,plain,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
inference(fof_simplification,[status(thm)],[basis_for_topology_28]) ).
cnf(c_0_19,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_collection(X3,top_of_basis(X2))
| ~ element_of_set(X1,f10(X2,X3,X4))
| ~ element_of_set(X4,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( element_of_set(X3,f10(X2,X1,X3))
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
c_0_16 ).
cnf(c_0_21,plain,
( element_of_collection(f1(X2,X1),X2)
| ~ element_of_set(X1,union_of_members(X2)) ),
inference(fof_simplification,[status(thm)],[union_of_members_2]) ).
cnf(c_0_22,plain,
( subset_sets(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_17 ).
cnf(c_0_23,plain,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
c_0_18 ).
cnf(c_0_24,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_collection(X3,top_of_basis(X2))
| ~ element_of_set(X1,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( element_of_collection(f1(X2,X1),X2)
| ~ element_of_set(X1,union_of_members(X2)) ),
c_0_21 ).
cnf(c_0_26,plain,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
inference(fof_simplification,[status(thm)],[union_of_members_1]) ).
cnf(c_0_27,plain,
( element_of_set(X3,X2)
| ~ subset_sets(X1,X2)
| ~ element_of_set(X3,X1) ),
inference(fof_simplification,[status(thm)],[set_theory_2]) ).
cnf(c_0_28,plain,
( subset_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
basis(cx,f),
lemma_1a_1 ).
cnf(c_0_30,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,f1(top_of_basis(X2),X3))
| ~ element_of_set(X3,union_of_members(top_of_basis(X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
c_0_26 ).
cnf(c_0_32,plain,
( element_of_set(X3,X2)
| ~ subset_sets(X1,X2)
| ~ element_of_set(X3,X1) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
subset_sets(union_of_members(f),cx),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,union_of_members(top_of_basis(X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,axiom,
( subset_sets(X1,X2)
| element_of_set(in_1st_set(X1,X2),X1) ),
set_theory_4 ).
cnf(c_0_36,plain,
( subset_sets(X1,X2)
| ~ element_of_set(in_1st_set(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[set_theory_5]) ).
cnf(c_0_37,negated_conjecture,
( element_of_set(X1,cx)
| ~ element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( subset_sets(union_of_members(top_of_basis(X1)),X2)
| element_of_set(in_1st_set(union_of_members(top_of_basis(X1)),X2),union_of_members(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ subset_sets(union_of_members(top_of_basis(f)),cx),
inference(fof_simplification,[status(thm)],[lemma_1a_2]) ).
cnf(c_0_40,plain,
( subset_sets(X1,X2)
| ~ element_of_set(in_1st_set(X1,X2),X2) ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
( subset_sets(union_of_members(top_of_basis(f)),X1)
| element_of_set(in_1st_set(union_of_members(top_of_basis(f)),X1),cx) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ subset_sets(union_of_members(top_of_basis(f)),cx),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : TOP001-2 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 11:26:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 21549 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FGUNF-FFSF31-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21556 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FGUNF-FFSF31-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 13
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 13
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 13
% 0.19/0.49 # Processed clauses : 40
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 1
% 0.19/0.49 # ...remaining for further processing : 39
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 25
% 0.19/0.49 # ...of the previous two non-redundant : 20
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 25
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 2
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 26
% 0.19/0.49 # Positive orientable unit clauses : 4
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 21
% 0.19/0.49 # Current number of unprocessed clauses: 6
% 0.19/0.49 # ...number of literals in the above : 19
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 13
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 59
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 55
% 0.19/0.49 # Non-unit clause-clause subsumptions : 1
% 0.19/0.49 # Unit Clause-clause subsumption calls : 3
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 2
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 880
% 0.19/0.49 # Search garbage collected termcells : 31
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.006 s
% 0.19/0.49 # Maximum resident set size: 1596 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.007 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.010 s
% 0.19/0.49 # Maximum resident set size: 1696 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------