TSTP Solution File: CAT012-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CAT012-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:24 EDT 2024
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 9 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.nJKvzXQVVH/E---3.1_7273.p',domain_codomain_composition1) ).
cnf(domain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.nJKvzXQVVH/E---3.1_7273.p',domain_has_elements) ).
cnf(prove_codomain_of_domain_is_domain,negated_conjecture,
codomain(domain(a)) != domain(a),
file('/export/starexec/sandbox2/tmp/tmp.nJKvzXQVVH/E---3.1_7273.p',prove_codomain_of_domain_is_domain) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nJKvzXQVVH/E---3.1_7273.p',compose_domain) ).
cnf(assume_domain_exists,hypothesis,
there_exists(domain(a)),
file('/export/starexec/sandbox2/tmp/tmp.nJKvzXQVVH/E---3.1_7273.p',assume_domain_exists) ).
cnf(c_0_5,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_6,plain,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
inference(fof_simplification,[status(thm)],[domain_has_elements]) ).
cnf(c_0_7,negated_conjecture,
codomain(domain(a)) != domain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_of_domain_is_domain]) ).
cnf(c_0_8,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
c_0_5 ).
cnf(c_0_9,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_10,plain,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
c_0_6 ).
cnf(c_0_11,hypothesis,
there_exists(domain(a)),
assume_domain_exists ).
cnf(c_0_12,negated_conjecture,
codomain(domain(a)) != domain(a),
c_0_7 ).
cnf(c_0_13,plain,
( codomain(domain(X1)) = domain(X1)
| ~ there_exists(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,hypothesis,
there_exists(a),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : CAT012-3 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n018.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 11:29:46 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.nJKvzXQVVH/E---3.1_7273.p
% 0.15/0.42 # Version: 3.1.0
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # sh5l with pid 7361 completed with status 0
% 0.15/0.42 # Result found by sh5l
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 7367 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGUSS-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 19
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 19
% 0.15/0.42 # Removed in clause preprocessing : 1
% 0.15/0.42 # Initial clauses in saturation : 18
% 0.15/0.42 # Processed clauses : 46
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 3
% 0.15/0.42 # ...remaining for further processing : 43
% 0.15/0.42 # Other redundant clauses eliminated : 2
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 42
% 0.15/0.42 # ...of the previous two non-redundant : 29
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 38
% 0.15/0.42 # Factorizations : 2
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 2
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 4
% 0.15/0.42 # ...of those cached : 0
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 24
% 0.15/0.42 # Positive orientable unit clauses : 5
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 1
% 0.15/0.42 # Non-unit-clauses : 18
% 0.15/0.42 # Current number of unprocessed clauses: 14
% 0.15/0.42 # ...number of literals in the above : 31
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 17
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 29
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 28
% 0.15/0.42 # Non-unit clause-clause subsumptions : 3
% 0.15/0.42 # Unit Clause-clause subsumption calls : 0
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 0
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 824
% 0.15/0.42 # Search garbage collected termcells : 28
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.004 s
% 0.15/0.42 # Maximum resident set size: 1580 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.007 s
% 0.15/0.42 # Maximum resident set size: 1700 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------