TSTP Solution File: CAT014-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CAT014-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Mon May 20 18:59:35 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 27 ( 13 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(codomain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).
cnf(assume_codomain_exists,hypothesis,
there_exists(codomain(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_codomain_exists) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
cnf(prove_codomain_is_idempotent,negated_conjecture,
codomain(codomain(a)) != codomain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_is_idempotent) ).
cnf(c_0_6,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
inference(fof_simplification,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_0_7,plain,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
inference(fof_simplification,[status(thm)],[codomain_has_elements]) ).
cnf(c_0_8,plain,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
c_0_6 ).
cnf(c_0_9,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_10,plain,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
c_0_7 ).
cnf(c_0_11,hypothesis,
there_exists(codomain(a)),
assume_codomain_exists ).
cnf(c_0_12,plain,
( domain(codomain(X1)) = codomain(X1)
| ~ there_exists(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
there_exists(a),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_15,hypothesis,
domain(codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
codomain(codomain(a)) != codomain(a),
inference(fof_simplification,[status(thm)],[prove_codomain_is_idempotent]) ).
cnf(c_0_17,hypothesis,
compose(codomain(a),codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
codomain(codomain(a)) != codomain(a),
c_0_16 ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_17]),c_0_15]),c_0_11])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CAT014-3 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 11:41:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox2/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/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 # new_bool_3 with pid 27642 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.19/0.49 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 27645 completed with status 0
% 0.19/0.49 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FHUSS-FFSF21-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I 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 : 19
% 0.19/0.49 # Removed by relevancy pruning/SinE : 8
% 0.19/0.49 # Initial clauses : 11
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 11
% 0.19/0.49 # Processed clauses : 31
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 31
% 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 : 45
% 0.19/0.49 # ...of the previous two non-redundant : 34
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 45
% 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 : 30
% 0.19/0.49 # ...of those cached : 17
% 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 : 20
% 0.19/0.49 # Positive orientable unit clauses : 11
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 8
% 0.19/0.49 # Current number of unprocessed clauses: 24
% 0.19/0.49 # ...number of literals in the above : 36
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 11
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 7
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 7
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 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 : 765
% 0.19/0.49 # Search garbage collected termcells : 41
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.002 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.004 s
% 0.19/0.49 # Maximum resident set size: 1588 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.002 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.007 s
% 0.19/0.49 # Maximum resident set size: 1708 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------