TSTP Solution File: TOP001-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : TOP001-2 : TPTP v8.1.2. Released v1.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:51:30 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 6 unt; 4 nHn; 30 RR)
% Number of literals : 74 ( 0 equ; 38 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 : 66 ( 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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',topology_generated_37) ).
cnf(set_theory_3,axiom,
( subset_sets(X1,X2)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',set_theory_3) ).
cnf(basis_for_topology_28,axiom,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',union_of_members_2) ).
cnf(lemma_1a_1,negated_conjecture,
basis(cx,f),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',lemma_1a_1) ).
cnf(union_of_members_1,axiom,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',set_theory_2) ).
cnf(set_theory_4,axiom,
( subset_sets(X1,X2)
| element_of_set(in_1st_set(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.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/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',set_theory_5) ).
cnf(lemma_1a_2,negated_conjecture,
~ subset_sets(union_of_members(top_of_basis(f)),cx),
file('/export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p',lemma_1a_2) ).
cnf(c_0_12,axiom,
( element_of_set(X1,union_of_members(X2))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,X2) ),
union_of_members_3 ).
cnf(c_0_13,axiom,
( element_of_collection(f10(X2,X1,X3),X2)
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
topology_generated_38 ).
cnf(c_0_14,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_12,c_0_13]) ).
cnf(c_0_15,axiom,
( element_of_set(X3,f10(X2,X1,X3))
| ~ element_of_collection(X1,top_of_basis(X2))
| ~ element_of_set(X3,X1) ),
topology_generated_37 ).
cnf(c_0_16,axiom,
( subset_sets(X1,X2)
| ~ equal_sets(X1,X2) ),
set_theory_3 ).
cnf(c_0_17,axiom,
( equal_sets(union_of_members(X2),X1)
| ~ basis(X1,X2) ),
basis_for_topology_28 ).
cnf(c_0_18,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_14,c_0_15]) ).
cnf(c_0_19,axiom,
( element_of_collection(f1(X2,X1),X2)
| ~ element_of_set(X1,union_of_members(X2)) ),
union_of_members_2 ).
cnf(c_0_20,plain,
( subset_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
basis(cx,f),
lemma_1a_1 ).
cnf(c_0_22,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_18,c_0_19]) ).
cnf(c_0_23,axiom,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
union_of_members_1 ).
cnf(c_0_24,axiom,
( element_of_set(X3,X2)
| ~ subset_sets(X1,X2)
| ~ element_of_set(X3,X1) ),
set_theory_2 ).
cnf(c_0_25,negated_conjecture,
subset_sets(union_of_members(f),cx),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,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_22,c_0_23]) ).
cnf(c_0_27,axiom,
( subset_sets(X1,X2)
| element_of_set(in_1st_set(X1,X2),X1) ),
set_theory_4 ).
cnf(c_0_28,negated_conjecture,
( element_of_set(X1,cx)
| ~ element_of_set(X1,union_of_members(f)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,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_26,c_0_27]) ).
cnf(c_0_30,axiom,
( subset_sets(X1,X2)
| ~ element_of_set(in_1st_set(X1,X2),X2) ),
set_theory_5 ).
cnf(c_0_31,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_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ subset_sets(union_of_members(top_of_basis(f)),cx),
lemma_1a_2 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : TOP001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 19:32:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.gRsSaVIULx/E---3.1_4768.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 4874 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUNF-FFSF31-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4881 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUNF-FFSF31-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 13
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 13
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 13
% 0.21/0.50 # Processed clauses : 40
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 1
% 0.21/0.50 # ...remaining for further processing : 39
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 25
% 0.21/0.50 # ...of the previous two non-redundant : 20
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 25
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 2
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 26
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 21
% 0.21/0.50 # Current number of unprocessed clauses: 6
% 0.21/0.50 # ...number of literals in the above : 19
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 13
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 59
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 55
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 3
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 812
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1632 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.007 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1680 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------