TSTP Solution File: CAT006-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CAT006-3 : 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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:27:21 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 20 unt; 0 nHn; 25 RR)
% Number of literals : 44 ( 19 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dx_equals_x,hypothesis,
( compose(d,X1) = X1
| ~ there_exists(compose(d,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',dx_equals_x) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',associativity_of_compose) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',compose_codomain) ).
cnf(da_exists,hypothesis,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',da_exists) ).
cnf(composition_implies_codomain,axiom,
( there_exists(codomain(X1))
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',composition_implies_codomain) ).
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',domain_codomain_composition1) ).
cnf(codomain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',codomain_has_elements) ).
cnf(prove_codomain_of_a_is_d,negated_conjecture,
codomain(a) != d,
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',prove_codomain_of_a_is_d) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p',compose_domain) ).
cnf(c_0_9,hypothesis,
( compose(d,X1) = X1
| ~ there_exists(compose(d,X1)) ),
inference(fof_simplification,[status(thm)],[dx_equals_x]) ).
cnf(c_0_10,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_11,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_12,hypothesis,
( compose(d,X1) = X1
| ~ there_exists(compose(d,X1)) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
there_exists(compose(d,a)),
da_exists ).
cnf(c_0_14,plain,
( there_exists(codomain(X1))
| ~ there_exists(compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[composition_implies_codomain]) ).
cnf(c_0_15,plain,
compose(codomain(X1),compose(X1,X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
compose(d,a) = a,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_18,plain,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
inference(fof_simplification,[status(thm)],[codomain_has_elements]) ).
cnf(c_0_19,plain,
( there_exists(codomain(X1))
| ~ there_exists(compose(X1,X2)) ),
c_0_14 ).
cnf(c_0_20,hypothesis,
compose(codomain(d),a) = a,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
there_exists(a),
inference(rw,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_22,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
codomain(a) != d,
inference(fof_simplification,[status(thm)],[prove_codomain_of_a_is_d]) ).
cnf(c_0_24,plain,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
c_0_18 ).
cnf(c_0_25,hypothesis,
there_exists(codomain(codomain(d))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_27,hypothesis,
domain(d) = codomain(a),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_28,negated_conjecture,
codomain(a) != d,
c_0_23 ).
cnf(c_0_29,hypothesis,
there_exists(codomain(d)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
~ there_exists(d),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CAT006-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:37:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.wKuzpSeUBY/E---3.1_24641.p
% 0.21/0.50 # Version: 3.1.0
% 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 # new_bool_1 with pid 24721 completed with status 0
% 0.21/0.50 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.21/0.50 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 24723 completed with status 0
% 0.21/0.50 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I 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 : 21
% 0.21/0.50 # Removed by relevancy pruning/SinE : 8
% 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 : 2
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 69
% 0.21/0.50 # ...of the previous two non-redundant : 58
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 69
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 36
% 0.21/0.50 # ...of those cached : 18
% 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 : 23
% 0.21/0.50 # Positive orientable unit clauses : 13
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 8
% 0.21/0.50 # Current number of unprocessed clauses: 43
% 0.21/0.50 # ...number of literals in the above : 70
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 16
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 10
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 10
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 4
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 941
% 0.21/0.50 # Search garbage collected termcells : 47
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.000 s
% 0.21/0.50 # Total time : 0.004 s
% 0.21/0.50 # Maximum resident set size: 1728 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1700 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------