TSTP Solution File: TOP003-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : TOP003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:51:07 EDT 2023
% Result : Satisfiable 0.16s 0.45s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named set_theory_8)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_11,axiom,
( subset_sets(X3,X2)
| ~ equal_sets(X1,X2)
| ~ subset_sets(X3,X1) ),
set_theory_10,
[final] ).
cnf(c_0_12,axiom,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
basis_for_topology_28,
[final] ).
cnf(c_0_13,plain,
( subset_sets(X1,X2)
| ~ subset_sets(X1,union_of_members(X3))
| ~ basis(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[final] ).
cnf(c_0_14,axiom,
( subset_sets(X1,union_of_members(X2))
| ~ element_of_collection(X1,X2) ),
set_theory_7,
[final] ).
cnf(c_0_15,plain,
( subset_sets(X1,X2)
| ~ basis(X2,X3)
| ~ element_of_collection(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]),
[final] ).
cnf(c_0_16,negated_conjecture,
basis(cx,f),
lemma_1c_1,
[final] ).
cnf(c_0_17,axiom,
subset_sets(X1,X1),
set_theory_9,
[final] ).
cnf(c_0_18,axiom,
( subset_sets(X2,X3)
| ~ equal_sets(X1,X2)
| ~ subset_sets(X1,X3) ),
set_theory_11,
[final] ).
cnf(c_0_19,axiom,
( element_of_set(X3,X2)
| ~ subset_sets(X1,X2)
| ~ element_of_set(X3,X1) ),
set_theory_8,
[final] ).
cnf(c_0_20,negated_conjecture,
( subset_sets(X1,cx)
| ~ element_of_collection(X1,f) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_21,axiom,
( element_of_collection(f1(X2,X1),X2)
| ~ element_of_set(X1,union_of_members(X2)) ),
union_of_members_2,
[final] ).
cnf(c_0_22,plain,
( subset_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]),
[final] ).
cnf(c_0_23,plain,
( subset_sets(X1,X2)
| ~ subset_sets(union_of_members(X3),X2)
| ~ basis(X1,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]),
[final] ).
cnf(c_0_24,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_collection(X3,X2)
| ~ element_of_set(X1,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]),
[final] ).
cnf(c_0_25,negated_conjecture,
( subset_sets(f1(f,X1),cx)
| ~ element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_26,negated_conjecture,
subset_sets(union_of_members(f),cx),
inference(spm,[status(thm)],[c_0_22,c_0_16]),
[final] ).
cnf(c_0_27,plain,
( subset_sets(X1,union_of_members(X2))
| ~ basis(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]),
[final] ).
cnf(c_0_28,plain,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,f1(X2,X3))
| ~ element_of_set(X3,union_of_members(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]),
[final] ).
cnf(c_0_29,axiom,
( element_of_collection(X1,top_of_basis(X2))
| element_of_set(f11(X2,X1),X1) ),
topology_generated_40,
[final] ).
cnf(c_0_30,negated_conjecture,
( element_of_set(X1,cx)
| ~ element_of_set(X1,f1(f,X2))
| ~ element_of_set(X2,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]),
[final] ).
cnf(c_0_31,negated_conjecture,
( element_of_set(X1,cx)
| ~ element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]),
[final] ).
cnf(c_0_32,negated_conjecture,
subset_sets(cx,union_of_members(f)),
inference(spm,[status(thm)],[c_0_27,c_0_16]),
[final] ).
cnf(c_0_33,plain,
( element_of_collection(f1(X1,X2),top_of_basis(X3))
| element_of_set(f11(X3,f1(X1,X2)),union_of_members(X1))
| ~ element_of_set(X2,union_of_members(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[final] ).
cnf(c_0_34,negated_conjecture,
( element_of_collection(f1(f,X1),top_of_basis(X2))
| element_of_set(f11(X2,f1(f,X1)),cx)
| ~ element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]),
[final] ).
cnf(c_0_35,plain,
( subset_sets(X1,union_of_members(X2))
| ~ basis(X1,X3)
| ~ element_of_collection(union_of_members(X3),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]),
[final] ).
cnf(c_0_36,negated_conjecture,
( element_of_collection(union_of_members(f),top_of_basis(X1))
| element_of_set(f11(X1,union_of_members(f)),cx) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]),
[final] ).
cnf(c_0_37,negated_conjecture,
( element_of_set(X1,union_of_members(f))
| ~ element_of_set(X1,cx) ),
inference(spm,[status(thm)],[c_0_19,c_0_32]),
[final] ).
cnf(c_0_38,negated_conjecture,
( subset_sets(cx,X1)
| ~ basis(X1,f) ),
inference(spm,[status(thm)],[c_0_13,c_0_32]),
[final] ).
cnf(c_0_39,negated_conjecture,
( subset_sets(X1,cx)
| ~ basis(X1,f) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]),
[final] ).
cnf(c_0_40,axiom,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
union_of_members_1,
[final] ).
cnf(c_0_41,negated_conjecture,
~ element_of_collection(cx,top_of_basis(f)),
lemma_1c_2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : TOP003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 19:27:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.wTIdhFi5fR/E---3.1_1235.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # sh5l with pid 1316 completed with status 1
% 0.16/0.45 # Result found by sh5l
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGUNF-FFSF21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 1323 completed with status 1
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGUNF-FFSF21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # No proof found!
% 0.16/0.45 # SZS status Satisfiable
% 0.16/0.45 # SZS output start Saturation
% See solution above
% 0.16/0.45 # Parsed axioms : 11
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 11
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 11
% 0.16/0.45 # Processed clauses : 44
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 2
% 0.16/0.45 # ...remaining for further processing : 42
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 27
% 0.16/0.45 # ...of the previous two non-redundant : 22
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 27
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 2
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 31
% 0.16/0.45 # Positive orientable unit clauses : 4
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 1
% 0.16/0.45 # Non-unit-clauses : 26
% 0.16/0.45 # Current number of unprocessed clauses: 0
% 0.16/0.45 # ...number of literals in the above : 0
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 11
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 95
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 90
% 0.16/0.45 # Non-unit clause-clause subsumptions : 2
% 0.16/0.45 # Unit Clause-clause subsumption calls : 5
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 738
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.004 s
% 0.16/0.45 # System time : 0.000 s
% 0.16/0.45 # Total time : 0.004 s
% 0.16/0.45 # Maximum resident set size: 1636 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.004 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.007 s
% 0.16/0.45 # Maximum resident set size: 1680 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------