TSTP Solution File: CAT005-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CAT005-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:30 EDT 2024
% Result : Unsatisfiable 0.22s 0.49s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 16 unt; 0 nHn; 26 RR)
% Number of literals : 56 ( 7 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 42 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity2,axiom,
( product(X1,X2,X1)
| ~ defined(X1,X2)
| ~ identity_map(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity2) ).
cnf(associative_property2,axiom,
( defined(X2,X4)
| ~ product(X1,X2,X3)
| ~ defined(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',associative_property2) ).
cnf(ad_defined,hypothesis,
defined(a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ad_defined) ).
cnf(d_is_identity_map,hypothesis,
identity_map(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_identity_map) ).
cnf(mapping_from_x_to_its_domain,axiom,
defined(X1,domain(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',mapping_from_x_to_its_domain) ).
cnf(composition_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).
cnf(domain_is_an_identity_map,axiom,
identity_map(domain(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',domain_is_an_identity_map) ).
cnf(identity1,axiom,
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ~ identity_map(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity1) ).
cnf(prove_domain_of_a_is_d,negated_conjecture,
domain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_a_is_d) ).
cnf(c_0_9,plain,
( product(X1,X2,X1)
| ~ defined(X1,X2)
| ~ identity_map(X2) ),
inference(fof_simplification,[status(thm)],[identity2]) ).
cnf(c_0_10,plain,
( defined(X2,X4)
| ~ product(X1,X2,X3)
| ~ defined(X3,X4) ),
inference(fof_simplification,[status(thm)],[associative_property2]) ).
cnf(c_0_11,plain,
( product(X1,X2,X1)
| ~ defined(X1,X2)
| ~ identity_map(X2) ),
c_0_9 ).
cnf(c_0_12,hypothesis,
defined(a,d),
ad_defined ).
cnf(c_0_13,hypothesis,
identity_map(d),
d_is_identity_map ).
cnf(c_0_14,plain,
( defined(X2,X4)
| ~ product(X1,X2,X3)
| ~ defined(X3,X4) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
product(a,d,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
( defined(d,X1)
| ~ defined(a,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
defined(X1,domain(X1)),
mapping_from_x_to_its_domain ).
cnf(c_0_18,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[composition_is_well_defined]) ).
cnf(c_0_19,hypothesis,
defined(d,domain(a)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
identity_map(domain(X1)),
domain_is_an_identity_map ).
cnf(c_0_21,plain,
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ~ identity_map(X1) ),
inference(fof_simplification,[status(thm)],[identity1]) ).
cnf(c_0_22,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_18 ).
cnf(c_0_23,hypothesis,
product(d,domain(a),d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ~ identity_map(X1) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
domain(a) != d,
inference(fof_simplification,[status(thm)],[prove_domain_of_a_is_d]) ).
cnf(c_0_26,hypothesis,
( X1 = d
| ~ product(d,domain(a),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
product(d,domain(a),domain(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
domain(a) != d,
c_0_25 ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CAT005-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 11:31:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.48 Running first-order model finding
% 0.22/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.22/0.49 # Version: 3.1.0
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # new_bool_3 with pid 21151 completed with status 0
% 0.22/0.49 # Result found by new_bool_3
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49 # Search class: FHUSS-FFSF11-SFFFFFNN
% 0.22/0.49 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.22/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.22/0.49 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 21156 completed with status 0
% 0.22/0.49 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49 # Search class: FHUSS-FFSF11-SFFFFFNN
% 0.22/0.49 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.22/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.22/0.49 # Preprocessing time : 0.001 s
% 0.22/0.49 # Presaturation interreduction done
% 0.22/0.49
% 0.22/0.49 # Proof found!
% 0.22/0.49 # SZS status Unsatisfiable
% 0.22/0.49 # SZS output start CNFRefutation
% See solution above
% 0.22/0.49 # Parsed axioms : 21
% 0.22/0.49 # Removed by relevancy pruning/SinE : 4
% 0.22/0.49 # Initial clauses : 17
% 0.22/0.49 # Removed in clause preprocessing : 0
% 0.22/0.49 # Initial clauses in saturation : 17
% 0.22/0.49 # Processed clauses : 48
% 0.22/0.49 # ...of these trivial : 1
% 0.22/0.49 # ...subsumed : 0
% 0.22/0.49 # ...remaining for further processing : 47
% 0.22/0.49 # Other redundant clauses eliminated : 0
% 0.22/0.49 # Clauses deleted for lack of memory : 0
% 0.22/0.49 # Backward-subsumed : 0
% 0.22/0.49 # Backward-rewritten : 0
% 0.22/0.49 # Generated clauses : 65
% 0.22/0.49 # ...of the previous two non-redundant : 49
% 0.22/0.49 # ...aggressively subsumed : 0
% 0.22/0.49 # Contextual simplify-reflections : 0
% 0.22/0.49 # Paramodulations : 65
% 0.22/0.49 # Factorizations : 0
% 0.22/0.49 # NegExts : 0
% 0.22/0.49 # Equation resolutions : 0
% 0.22/0.49 # Disequality decompositions : 0
% 0.22/0.49 # Total rewrite steps : 16
% 0.22/0.49 # ...of those cached : 6
% 0.22/0.49 # Propositional unsat checks : 0
% 0.22/0.49 # Propositional check models : 0
% 0.22/0.49 # Propositional check unsatisfiable : 0
% 0.22/0.49 # Propositional clauses : 0
% 0.22/0.49 # Propositional clauses after purity: 0
% 0.22/0.49 # Propositional unsat core size : 0
% 0.22/0.49 # Propositional preprocessing time : 0.000
% 0.22/0.49 # Propositional encoding time : 0.000
% 0.22/0.49 # Propositional solver time : 0.000
% 0.22/0.49 # Success case prop preproc time : 0.000
% 0.22/0.49 # Success case prop encoding time : 0.000
% 0.22/0.49 # Success case prop solver time : 0.000
% 0.22/0.49 # Current number of processed clauses : 30
% 0.22/0.49 # Positive orientable unit clauses : 12
% 0.22/0.49 # Positive unorientable unit clauses: 0
% 0.22/0.49 # Negative unit clauses : 1
% 0.22/0.49 # Non-unit-clauses : 17
% 0.22/0.49 # Current number of unprocessed clauses: 35
% 0.22/0.49 # ...number of literals in the above : 95
% 0.22/0.49 # Current number of archived formulas : 0
% 0.22/0.49 # Current number of archived clauses : 17
% 0.22/0.49 # Clause-clause subsumption calls (NU) : 88
% 0.22/0.49 # Rec. Clause-clause subsumption calls : 80
% 0.22/0.49 # Non-unit clause-clause subsumptions : 0
% 0.22/0.49 # Unit Clause-clause subsumption calls : 0
% 0.22/0.49 # Rewrite failures with RHS unbound : 0
% 0.22/0.49 # BW rewrite match attempts : 1
% 0.22/0.49 # BW rewrite match successes : 0
% 0.22/0.49 # Condensation attempts : 0
% 0.22/0.49 # Condensation successes : 0
% 0.22/0.49 # Termbank termtop insertions : 1299
% 0.22/0.49 # Search garbage collected termcells : 66
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.002 s
% 0.22/0.49 # System time : 0.003 s
% 0.22/0.49 # Total time : 0.006 s
% 0.22/0.49 # Maximum resident set size: 1768 pages
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.004 s
% 0.22/0.49 # System time : 0.005 s
% 0.22/0.49 # Total time : 0.009 s
% 0.22/0.49 # Maximum resident set size: 1712 pages
% 0.22/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------