TSTP Solution File: COL052-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL052-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:28:07 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 13 RR)
% Number of literals : 34 ( 16 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(agreeable1,axiom,
( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
| ~ agreeable(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',agreeable1) ).
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',composer_exists) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',c_composes_a_with_b) ).
cnf(agreeable2,axiom,
( agreeable(X1)
| response(X1,X2) != response(compatible(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',agreeable2) ).
cnf(c_is_agreeable,hypothesis,
agreeable(c),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',c_is_agreeable) ).
cnf(prove_a_is_agreeable,negated_conjecture,
~ agreeable(a),
file('/export/starexec/sandbox2/tmp/tmp.vo0oOlESKS/E---3.1_18168.p',prove_a_is_agreeable) ).
cnf(c_0_6,plain,
( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
| ~ agreeable(X1) ),
inference(fof_simplification,[status(thm)],[agreeable1]) ).
cnf(c_0_7,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_8,hypothesis,
c = compose(a,b),
c_composes_a_with_b ).
cnf(c_0_9,plain,
( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
| ~ agreeable(X1) ),
c_0_6 ).
cnf(c_0_10,plain,
( agreeable(X1)
| response(X1,X2) != response(compatible(X1),X2) ),
inference(fof_simplification,[status(thm)],[agreeable2]) ).
cnf(c_0_11,hypothesis,
response(a,response(b,X1)) = response(c,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( response(X1,common_bird(X1)) = response(X2,response(X3,common_bird(X1)))
| ~ agreeable(compose(X2,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,hypothesis,
agreeable(c),
c_is_agreeable ).
cnf(c_0_14,plain,
( agreeable(X1)
| response(X1,X2) != response(compatible(X1),X2) ),
c_0_10 ).
cnf(c_0_15,plain,
( response(X1,common_bird(compose(X2,X3))) = response(X2,response(X3,common_bird(compose(X2,X3))))
| ~ agreeable(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ agreeable(a),
inference(fof_simplification,[status(thm)],[prove_a_is_agreeable]) ).
cnf(c_0_17,hypothesis,
response(X1,common_bird(X1)) = response(c,common_bird(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8]),c_0_13])]) ).
cnf(c_0_18,plain,
( agreeable(X1)
| response(X2,common_bird(compose(compatible(X1),X3))) != response(X1,response(X3,common_bird(compose(compatible(X1),X3))))
| ~ agreeable(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ agreeable(a),
c_0_16 ).
cnf(c_0_20,hypothesis,
( response(X1,common_bird(X2)) = response(c,common_bird(X2))
| ~ agreeable(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,hypothesis,
~ agreeable(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]),c_0_20]) ).
cnf(c_0_22,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_13,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL052-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n009.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Fri May 3 11:34:55 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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.vo0oOlESKS/E---3.1_18168.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18247 completed with status 0
% 0.20/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSF-FFSF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 18254 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSF-FFSF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 6
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 6
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 6
% 0.20/0.52 # Processed clauses : 96
% 0.20/0.52 # ...of these trivial : 3
% 0.20/0.52 # ...subsumed : 51
% 0.20/0.52 # ...remaining for further processing : 42
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 25
% 0.20/0.52 # Backward-rewritten : 1
% 0.20/0.52 # Generated clauses : 300
% 0.20/0.52 # ...of the previous two non-redundant : 262
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 297
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 2
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 83
% 0.20/0.52 # ...of those cached : 69
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 9
% 0.20/0.52 # Positive orientable unit clauses : 4
% 0.20/0.52 # Positive unorientable unit clauses: 1
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 3
% 0.20/0.52 # Current number of unprocessed clauses: 178
% 0.20/0.52 # ...number of literals in the above : 585
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 33
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 344
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 251
% 0.20/0.52 # Non-unit clause-clause subsumptions : 47
% 0.20/0.52 # Unit Clause-clause subsumption calls : 27
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 23
% 0.20/0.52 # BW rewrite match successes : 7
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 4681
% 0.20/0.52 # Search garbage collected termcells : 7
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.006 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.009 s
% 0.20/0.52 # Maximum resident set size: 1588 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.036 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.042 s
% 0.20/0.52 # Maximum resident set size: 1692 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------